✦ LIBER ✦

A non-Hamiltonian planar graph

✍ Scribed by W. T. Tutte

Publisher: Akadmiai Kiad
Year: 1960
Tongue: English
Weight: 211 KB
Volume: 11
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf02020951

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Every 4-Connected Line Graph of a Planar

Every 4-Connected Line Graph of a Planar Graph is Hamiltonian

✍ Hong-Jian Lai 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 217 KB

An Infinite Family of Planar Non-Hamilto

An Infinite Family of Planar Non-Hamiltonian Bihomogeneously Traceable Oriented Graphs

✍ Carol T. Zamfirescu 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 358 KB

Non-hamiltonian bicubic graphs

✍ John P Georges 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Non-hamiltonian cubic planar maps

✍ G.B. Faulkner; D.H. Younger 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 273 KB

The smallest non-hamiltonian 3-connected

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices

✍ D.A Holton; B.D McKay 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 604 KB