Results 271 to 280 of about 60,523 (284)

Sustainability in Reconstructive Breast Surgery: An Eco-audit of the Deep Inferior Epigastric Perforator Flap Pathway. [PDF]

Plast Reconstr Surg Glob Open
Ahmed Z, Zargaran A, Zargaran D, Sousi S, Hakimnia K, Panagiota Glynou S, Davies J, Hamilton S, Mosahebi A.   +8 more
europepmc   +1 more source

Early In-Bed Cycle Ergometry With Critically Ill, Mechanically Ventilated Patients: Statistical Analysis Plan for CYCLE (Critical Care Cycling to Improve Lower Extremity Strength), an International, Multicenter, Randomized Clinical Trial.

JMIR Res Protoc
Heels-Ansdell D, Kelly L, O'Grady HK, Farley C, Reid JC, Berney S, Pastva AM, Burns KE, D'Aragon F, Herridge MS, Seely A, Rudkowski J, Rochwerg B, Fox-Robichaud A, Ball I, Lamontagne F, Duan EH, Tsang J, Archambault PM, Verceles AC, Muscedere J, Mehta S, English SW, Karachi T, Serri K, Reeve B, Thabane L, Cook D, Kho ME.   +28 more
europepmc   +1 more source

Manganese-induced Precocious Puberty Alters Mammary Epithelial Cell Proliferation in Female Rats.

Endocrinology
Hamilton AM, Srivastava VK, Hiney JK, Dees WL, Dearth RK.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the Hamilton Cycle of the Hypercube

Key Engineering Materials, 2011
Hypercube is one of the basic types of interconnection networks. In this paper, we use the concept of the Cartesian product graph to define the hypercube Qn, we study the relationship between the isomorphic graphs and the Cartesian product graphs, and we get the result that there exists a Hamilton cycle in the hypercube Qn.
Yan Zhong Hu, Hua Dong Wang
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   +4 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

A Note on Hamilton Cycles

1985
The following extension of Dirac's Theorem is proved. If G is a non-hamiltonian graph with at least three vertices and p,q are a pair of natural numbers satisfying p+q = δ(G)+1, then K p,q ⊂ G c .
openaire   +2 more sources