Flip-Flops in Hypohamiltonian Graphs
Canadian mathematical bulletin, Tome 16 (1973) no. 1, pp. 33-41
Voir la notice de l'article provenant de la source Cambridge
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.
Chvátal, V. Flip-Flops in Hypohamiltonian Graphs. Canadian mathematical bulletin, Tome 16 (1973) no. 1, pp. 33-41. doi: 10.4153/CMB-1973-008-9
@article{10_4153_CMB_1973_008_9,
author = {Chv\'atal, V.},
title = {Flip-Flops in {Hypohamiltonian} {Graphs}},
journal = {Canadian mathematical bulletin},
pages = {33--41},
year = {1973},
volume = {16},
number = {1},
doi = {10.4153/CMB-1973-008-9},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1973-008-9/}
}
Cité par Sources :