✦ LIBER ✦

Nonhamiltonian 3-Connected Cubic Planar Graphs

✍ Scribed by Aldred, R. E. L.; Bau, S.; Holton, D. A.; McKay, Brendan D.

Book ID: 118197276
Publisher: Society for Industrial and Applied Mathematics
Year: 2000
Tongue: English
Weight: 216 KB
Volume: 13
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480198348665

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The smallest 2-connected cubic bipartite

The smallest 2-connected cubic bipartite planar nonhamiltonian graph

✍ Takao Asano; Nobuji Saito; Geoffrey Exoo; Frank Harary 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 519 KB

## Butte producxd ihe first example of a 3-connected cubic planar nonhamihonian gJaph. On adding the cxmcition that the graph must he bipartite and admitting 2-connected graphs. We prove that the smallest possible such graph has 26 points and is unique.

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

Cycles Through 23 Vertices in 3-Connecte

Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs

✍ R. E. L. Aldred; S. Bau; D. A. Holton; Brendan D. McKay 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 58 KB

A 1-tough nonhamiltonian maximal planar

A 1-tough nonhamiltonian maximal planar graph

✍ Takao Nishizeki 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 93 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

Connected Spanning Subgraphs of 3-Connec

Connected Spanning Subgraphs of 3-Connected Planar Graphs

✍ Hikoe Enomoto; Tadashi Iida; Katsuhiro Ota 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 339 KB