Results 261 to 270 of about 2,225,625 (302)

Influence of Preoperative Cognitive Function, Self-Efficacy, and Postoperative Psychological Counselling on Anxiety and Depression Levels in Patients Undergoing Botulinum Toxin Injections. [PDF]

Actas Esp Psiquiatr
Yu X, Zhang Y, Zhang L, Chen T, Yao B.
europepmc   +1 more source

Endovenous embolization of pelvic congestion syndrome: Impact on pain, sexual function, and quality of life-A multidisciplinary prospective single-arm cohort study. [PDF]

J Vasc Surg Venous Lymphat Disord
Badak TO, Cereb F, Cakallioglu A, Polat S, Ucak HA, Uncu H.   +5 more
europepmc   +1 more source

The impact of bright light therapy on non-motor symptoms in patients with Parkinson's disease: a systematic review and meta-analysis. [PDF]

Front Neurol
Geng J, Yu HL, Tan L.
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   +4 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   +2 more sources

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   +3 more sources

Neighborhood unions and hamilton cycles

Journal of Graph Theory, 1991
AbstractLet G be a graph on n vertices and N2(G) denote the minimum size of N(u) ∪ N(v) taken over all pairs of independent vertices u, v of G. We show that if G is 3‐connected and N2(G) ⩾ ½(n + 1), then G has a Hamilton cycle. We show further that if G is 2‐connected and N2(G) ⩾ ½(n + 3), then either G has a Hamilton cycle or else G belongs to one of ...
openaire   +1 more source