✦ LIBER ✦

Non-hamiltonian cubic planar maps

✍ Scribed by G.B. Faulkner; D.H. Younger

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 273 KB
Volume: 7
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(74)80019-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A non-Hamiltonian planar graph

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

Realization of Period Maps of Planar Ham

Realization of Period Maps of Planar Hamiltonian Systems

✍ Carlos Rocha 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 337 KB

Construction of Hamiltonian Cycles in La

Construction of Hamiltonian Cycles in Layered Cubic Planar Graphs

✍ D.S. Franzblau 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 362 KB

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

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.