Results 261 to 270 of about 33,701 (288)

The Hamilton cycle space of random regular graphs and randomly perturbed graphs [PDF]

Dan Hefetz, Michael Krivelevich
openalex  

Bacteriophage-loaded microneedle patches for targeted and minimally disruptive foodborne pathogen decontamination. [PDF]

Sci Adv
Prasad A, Khan S, Arshad F, Sidhu H, Jackson K, MacLachlan R, Kvitka E, Grignano V, Mann H, Filipe CDM, Hosseinidoust Z, Didar TF.   +11 more
europepmc   +1 more source

Efficacy and cardiovascular safety of liposomal doxorubicin: a systematic review and meta-analysis of randomized trials. [PDF]

Cardiooncology
Cavalli GD, Lopez-Lopez JP, Carandang FC, Johnstone A, Scampoli S, Rana R, Meireles PT, Petropoulos JA, Hillis C, Balitsky A, Upshaw J, Leong DP.   +11 more
europepmc   +1 more source

Comments on "An Observational Case-control Study for BDNF Val66Met Polymorphism and Serum BDNF in Patients with Major Depressive Disorder (MDD)". [PDF]

Indian J Psychol Med
Ajay S, Lakshmi S, Spoorthy MS.
europepmc   +1 more source

Structural and epistatic regulatory variants cause hallmark white spotting in cattle. [PDF]

Sci Adv
Jivanji S, Wilkinson E, Tang L, Tiplady KM, Yeates A, Harland C, Gray C, Couldrey C, Worth G, Gamache I, Desjardins J, Tabares JAA, Yamanaka N, McNaughton L, Brennan L, Cloutier MP, Cowan M, Ellison R, Fransen T, Monehan T, Spelman RJ, Snell RG, Charlier C, Yamanaka Y, Garrick D, Mort R, Littlejohn MD.   +26 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Oriented hamilton cycles in digraphs

Journal of Graph Theory, 1995
AbstractWe show that a directed graph of order n will contain n‐cycles of every orientation, provided each vertex has indegree and outdegree at least (1/2 + n‐1/6)n and n is sufficiently large. © 1995 John Wiley & Sons, Inc.
Häggkvist, Roland, Thomason, Andrew
openaire   +1 more source

Packing Directed Hamilton Cycles Online

SIAM Journal on Discrete Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anastos, Michael, Briggs, Joseph
openaire   +2 more sources

Independence trees and Hamilton cycles

Journal of Graph Theory, 1998
Summary: Let \(G\) be a connected graph on \(n\) vertices. A spanning tree \(T\) of \(G\) is called an independence tree, if the set of end vertices of \(T\) (vertices with degree one in \(T\)) is an independent set in \(G\). If \(G\) has an independence tree, then \(\alpha_t(G)\) denotes the maximum number of end vertices of an independence tree of ...
Broersma, Haitze J., Tuinstra, Hilde
openaire   +3 more sources