Results 241 to 250 of about 442,994 (288)

Exploring the impact of acute solvent exposure on larval zebrafish behaviour. [PDF]

Front Behav Neurosci
Hagen EV, Harper MMM, Zhang Y, Hamilton TJ.   +3 more
europepmc   +1 more source

Troubleshooting Severe Airflow Obstruction With a Pressure-Limited Transport Ventilator: Lessons From Two Cases. [PDF]

Crit Care Explor
Reardon PM, Bishop MJ, Yarnell CJ, Benaim JA, Barclay C, Tello GV, Pan A.   +6 more
europepmc   +1 more source

Novel ThyPRO-39-based nomogram for identifying impaired quality of life in Graves' hyperthyroidism outpatients: development and internal validation. [PDF]

Endocr Connect
Nie J, Wang Y, Mo Y, Liu C, Xu S, Li D.
europepmc   +1 more source

Factors influencing suicidal ideation in Chinese adolescents with first-episode depressive disorder: a cross-sectional study. [PDF]

BMC Psychol
Zhang Y, Suo X, Xu J, Li W, Wang X, Xu W, Pan L, Wang J, Gao J.   +8 more
europepmc   +1 more source

Cerebellar Tissue Properties Alterations in Fibromyalgia: A T1w/T2w Ratio Study. [PDF]

Hum Brain Mapp
Quidé Y, Gustin SM.
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