The smallest 2-connected cubic bipartite planar nonhamiltonian graph

✍ Scribed by Takao Asano; Nobuji Saito; Geoffrey Exoo; Frank Harary

• Publisher: Elsevier Science
• Year: 1982
• Tongue: English
• Weight: 519 KB
• Volume: 38
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(82)90162-5

✦ Synopsis

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.