Flip-Flops in Hypohamiltonian Graphs
暂无分享,去创建一个
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.
[1] J. Bondy. Variations on the Hamiltonian Theme , 1972, Canadian Mathematical Bulletin.
[2] W. Lindgren. An Infinite Class of Hypohamiltonian Graphs , 1967 .
[3] W. T. Tutte. A Non-Hamiltonian Graph , 1960, Canadian Mathematical Bulletin.
[4] W. Roberts. Solution du problême , 1861 .