✦ LIBER ✦

Pancyclicity of Hamiltonian and highly connected graphs

✍ Scribed by Peter Keevash; Benny Sudakov

Book ID: 108167482
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 229 KB
Volume: 100
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2010.02.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pancyclicity of connected circulant grap

Pancyclicity of connected circulant graphs

✍ Bogdanowicz, Z. R. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB 👁 1 views

The circulant G,(al,. . . , ak), where 0 < al < ... < a k < ( n + 1 ) / 2 , is defined as the vertex-transitive graph that has vertices ifal,. . . ,if a k (mod n) adjacent to each vertex i. In this work we show that the connected circulants of degree at least three contain all even cycles. In additi

A note on pancyclism of highly connected

A note on pancyclism of highly connected graphs

✍ Evelyne Flandrin; Hao Li; Antoni Marczyk; Mariusz Woźniak 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Pancyclism and Bipancyclism of Hamiltoni

Pancyclism and Bipancyclism of Hamiltonian Graphs

✍ S.M. Zhang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 328 KB

On pancyclism of hamiltonian graphs

✍ Antoni Marczyk 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Edge-pancyclicity and Hamiltonian connec

Edge-pancyclicity and Hamiltonian connectivity of twisted cubes

✍ Min Xu 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 190 KB

On hamiltonian-connected graphs

✍ Ronald J. Gould; Xingxing Yu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 735 KB

## Abstract One of the most fundamental results concerning paths in graphs is due to Ore: In a graph __G__, if deg __x__ + deg __y__ ≧ |__V__(__G__)| + 1 for all pairs of nonadjacent vertices __x, y__ ≅ __V__(__G__), then __G__ is hamiltonian‐connected. We generalize this result using set degrees.