Results 161 to 170 of about 41,749 (283)

Hydrogel‐based drug delivery systems for intracerebral hemorrhage with therapeutic advances and emerging roles of the bone–brain axis

open access: yesInterdisciplinary Medicine, EarlyView.
Hydrogel‐based drug delivery systems offer a promising approach for treating intracerebral hemorrhage (ICH) by overcoming blood‐brain barrier limitations, enabling precise, sustained release of neuroprotective and anti‐inflammatory agents. These systems enhance treatment efficacy, but challenges remain in biosafety, drug penetration, and scalability ...
Haojun Shi   +18 more
wiley   +1 more source

On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley   +1 more source

Tight Bounds for Hypercube Minor‐Universality

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT A graph G $G$ is m $m$‐minor‐universal if every graph H $H$ with at most m $m$ edges and no isolated vertices is contained as a minor in G $G$. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c>0 $c\gt 0$ such that the d $d$‐dimensional hypercube Qd ${Q}_{d}$ is (c⋅2d/d $c\cdot {2}^{d}/d$)‐minor‐universal ...
Emma Hogan   +5 more
wiley   +1 more source

Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) $G=(V,E)$ is said to be ( X , Y ) $(X,Y)$‐embeddable if any set of induced edge lengths from an ...
Sean Dewar   +3 more
wiley   +1 more source

Fractional List Packing for Layered Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

Bit-reproducible parallel phylogenetic tree inference. [PDF]

open access: yesBioinformatics
Stelz C, Hübner L, Stamatakis A.
europepmc   +1 more source

A new, ~4500‐year varve record and high‐resolution tephrochronology from lake Hämälänlampi, eastern Finland, provides age constraints for the Furnas C and the Glen Garry/Askja A‐2000 eruptions

open access: yesJournal of Quaternary Science, EarlyView.
ABSTRACT The northern European distal cryptotephra framework is constantly developing both in terms of identification of new tephra horizons and improved age constraints for the already well‐established tephra marker horizons. However, many prehistoric tephra layers have only been dated by the radiocarbon method, with its inherent problems.
Maarit Kalliokoski   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy