Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T10:36:42.528Z Has data issue: false hasContentIssue false

Flip-Flops in Hypohamiltonian Graphs

Published online by Cambridge University Press:  20 November 2018

V. Chvátal*
Affiliation:
Centre De Recherches Mathématiques,Montréal Québec
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Throughout this note, we adopt the graph-theoretical terminology and notation of Harary [3]. A graph G is hypohamiltonianif G is not hamiltonian but the deletion of any point u from G results in a hamiltonian graph G-u. Gaudin, Herz, and Rossi [2] proved that the smallest hypohamiltonian graph is the Petersen graph. Using a computer for a systematic search, Herz, Duby, and Vigué [4] found that there is no hypohamiltonian graph with 11 or 12 points. However, they found one with 13 and one with 15 points. Sousselier [4] and Lindgren [5] constructed independently the same sequence of hypohamiltonian graphs with 6k+10 points. Moreover, Sousselier found a cubic hypohamiltonian graph with 18 points. This graph and the Petersen graph were the only examples of cubic hypohamiltonian graphs until Bondy [1] constructed an infinite sequence of cubic hypohamiltonian graphs with 12k+10 points. Bondy also proved that the Coxeter graph [6], which is cubic with 28 points, is hypohamiltonian.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1973