Results 281 to 290 of about 445,337 (327)

Automation and machine learning drive rapid optimization of isoprenol production in Pseudomonas putida. [PDF]

Nat Commun
Carruthers DN, Kinnunen PC, Li Y, Chen Y, Gin JW, Yunus IS, Galliard WR, Tan S, Radivojevic T, Adams PD, Singh AK, Sustarich J, Petzold CJ, Mukhopadhyay A, Garcia Martin H, Lee TS.   +15 more
europepmc   +1 more source

Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model

Michael Molloy, Paweł Prałat, Gregory B. Sorkin   +2 more
openalex   +1 more source

Chronic <i>Cyclospora</i> infection in a heart transplant patient with intestinal malabsorption: a case report. [PDF]

ASM Case Rep
Ambrose K, Hamilton-Seth R, Jackson M, Sigler R, Fels Elliott DR.   +4 more
europepmc   +1 more source

Metabolic profiling of meningioma reveals novel subgroup-specific biologic insights and outcome dependencies. [PDF]

Neuro Oncol
Landry AP, Wang JZ, Yefet LS, Liu J, Patil V, Zhang WJ, Sosa J, Ellenbogen Y, Gui C, Ajisebutu A, Aldape K, Gao A, Kislinger T, Chen EX, Nassiri F, Zadeh G.   +15 more
europepmc   +1 more source

Journey of a pill. [PDF]

Can Fam Physician
Kaur H, Parascandalo F, Krantzberg G, Ko E, Mathur N, Gill AS, Razack F, Sergeant M.   +7 more
europepmc   +1 more source

Could photoperiodic responses have evolved before the emergence of circadian clocks? [PDF]

New Phytol
Jabbur ML, Johnson CH.
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

Polychromatic Hamilton cycles

1991
Abstract: "The edges of the complete graph K[subscript n] are coloured so that no colour appears no more than k times, k = [n/A 1n n], for some sufficiently large A. We show that there is always a Hamiltonian cycle in which each edge is a different colour. The proof technique is probabilistic."
Frieze, Reed, Bruce A.
openaire   +1 more source