✦ LIBER ✦

Non-hamiltonian bicubic graphs

✍ Scribed by John P Georges

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 192 KB
Volume: 46
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90012-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A non-Hamiltonian planar graph

✍ W. T. Tutte 📂 Article 📅 1960 🏛 Akadmiai Kiad 🌐 English ⚖ 211 KB

Independent Production of Non Hamiltonia

Independent Production of Non Hamiltonian Graphs

✍ Samuel Jurkiewicz; Kelly Elaine Fonseca Freitas; Daniela Fuchs Salomão 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Non-hamiltonian 54-tough maximal planar

Non-hamiltonian 54-tough maximal planar graphs

✍ Jochen Harant; Peter J. Owens 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 194 KB

By a theorem of the toughness t(G) of a non-hamiitonian maximal planar graph G is less than or equal to 2. Improving a result of , it is shown that the shortness exponent of the class of maximal planar graphs with toughness greater than or equal to ~ is less than 1.

Non-hamiltonian 3-connected cubic bipart

Non-hamiltonian 3-connected cubic bipartite graphs

✍ M.N Ellingham; J.D Horton 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Maximally non-hamiltonian graphs of girt

Maximally non-hamiltonian graphs of girth 7

✍ Ladislav Stacho 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 689 KB

On the 2-factors of bicubic graphs

✍ W.T. Tutte 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 291 KB

A cubt~ g~aph of 2n vet "th:es and Po components has n + PO linearly independent 2-fact(~ Thus each cycle of the graph can b: expressed as a rood 2 sum of 2-factogs. Only fini~ f~phs are conside~d. The number of vertices of a trivalent graph must be even. If we write it as ~ then the number of edge