Results 241 to 250 of about 446,387 (282)

Ultrasound-Guided Stellate Ganglion Block with Cervicotemporal Myofascial Trigger Point Acupuncture for Insomnia with Comorbid Anxiety and Depression: A Retrospective Observational Study. [PDF]

Nat Sci Sleep
Li Z, Wang L, Cong P, Chen S, Wang J, Zhang H, Zhao J, Li G, Jiao F, Li L, Wang R, Wu Q, Gong M, Chen Z, Wang Y.   +14 more
europepmc   +1 more source

Cost-Effectiveness of In-Bed Cycling and Routine Physiotherapy for Patients Receiving Mechanical Ventilation.

JAMA Netw Open
Tarride JE, Blackhouse G, Rochwerg B, Fox-Robichaud AE, Ball IM, Burns KEA, Seely AJE, Muscedere J, Berney S, Pastva AM, D'Aragon F, Archambault PM, Tsang JL, Verceles AC, Serri K, Reeve BK, English SW, Lamontagne F, Karachi T, Duan EH, Strong G, Kelly L, Reid JC, Rudkowski JC, O'Grady HK, Herridge MS, Thabane L, Heels-Ansdell D, Cook DJ, Kho ME, Canadian Critical Care Trials Group.   +30 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Hamilton cycles in prisms

Journal of Graph Theory, 2007
AbstractThe prism over a graph G is the Cartesian product G □ K2 of G with the complete graph K2. If G is hamiltonian, then G□K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be an interesting relaxation of being hamiltonian.
Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld 0001, Heinz-Jürgen Voss   +4 more
openaire   +1 more source

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.
Roland Häggkvist, Andrew Thomason 0001
openaire   +1 more source

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 ...
Hajo Broersma, Hilde Tuinstra
openaire   +3 more sources

Hamilton cycles in plane triangulations

Journal of Graph Theory, 2002
AbstractWe extend Whitney's Theorem that every plane triangulation without separating triangles is hamiltonian by allowing some separating triangles. More precisely, we define a decomposition of a plane triangulation G into 4‐connected ‘pieces,’ and show that if each piece shares a triangle with at most three other pieces then G is hamiltonian.
Bill Jackson, Xingxing Yu
openaire   +1 more source

Hamilton Cycles and Paths in Fullerenes

Journal of Chemical Information and Modeling, 2007
AbstractChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 200 leading journals. To access a ChemInform Abstract, please click on HTML or PDF.
openaire   +2 more sources

Hamilton Cycles in Oriented Graphs

Combinatorics, Probability and Computing, 1993
It is shown that an oriented graph of order n whose every indegree and outdegree is at least cn is hamiltonian if c ≥ ½ − 2−15 but need not be if c < ⅜.
openaire   +1 more source