On a construction of Thomassen
暂无分享,去创建一个
Using a construction of Thomassen [Discrete Math. 9, 91–96 (1974)] we prove that for infinitely manyn there is a familyℱn of triangle-free maximally non-hamiltonian graphs of ordern with |ℱn| → ∞ exponentially inn. In particular, for everym ≧ 48 we construct such a graph; an infinite number of these provide new “almost extremal” examples in the sense of minimal size.
[1] J. Bondy. Variations on the Hamiltonian Theme , 1972, Canadian Mathematical Bulletin.
[2] R. C. Entringer,et al. Smallest maximally nonhamiltonian graphs , 1983 .
[3] R. Isaacs. Infinite Families of Nontrivial Trivalent Graphs Which are not Tait Colorable , 1975 .
[4] Carsten Thomassen. Hypohamiltonian and hypotraceable graphs , 1974, Discret. Math..