✦ LIBER ✦

Longest cycles in 3-connected cubic graphs

✍ Scribed by Bill Jackson

Book ID: 107884229
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 549 KB
Volume: 41
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(86)90024-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Longest cycles in 3-connected graphs

✍ B. Wei 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Chords of Longest Cycles in Cubic Graphs

✍ Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 213 KB

We describe a general sufficient condition for a Hamiltonian graph to contain another Hamiltonian cycle. We apply it to prove that every longest cycle in a 3-connected cubic graph has a chord. We also verify special cases of an old conjecture of Sheehan on Hamiltonian cycles in 4-regular graphs and

Longest Cycles in 3-connected Graphs wit

Longest Cycles in 3-connected Graphs with Given Independence Number

✍ Y. Manoussakis 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 113 KB

Longest cycles in 3-connected graphs con

Longest cycles in 3-connected graphs contain three contractible edges

✍ Nathaniel Dean; Robert L. Hemminger; Katsuhiro Ota 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB 👁 1 views

We show that if G is a 3-connected graph of order at least seven, then every longest path between distinct vertices in G contains at least two contractible edges. An immediate corollary is that longest cycles in such graphs contain at least three contractible edges. We consider only finite undirect

Cycles through five edges in 3-connected

Cycles through five edges in 3-connected cubic graphs

✍ R. E. L. Aldred; D. A. Holton 📂 Article 📅 1987 🏛 Springer Japan 🌐 English ⚖ 673 KB

Hamiltonian cycles in cubic 3-connected

Hamiltonian cycles in cubic 3-connected bipartite planar graphs

✍ D.A Holton; B Manvel; B.D McKay 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 891 KB