Flip-Flops in Hypohamiltonian Graphs
- 1 March 1973
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 16 (1) , 33-41
- https://doi.org/10.4153/cmb-1973-008-9
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Variations on the Hamiltonian ThemeCanadian Mathematical Bulletin, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- An Infinite Class of Hypohamiltonian GraphsThe American Mathematical Monthly, 1967
- A Non-Hamiltonian GraphCanadian Mathematical Bulletin, 1960