论文信息 - Cubic maximal nontraceable graphs

Cubic maximal nontraceable graphs

We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that realize this bound.

Marietjie Frick | Joy Singleton

[1] Lane H. Clark,et al. Smallest maximally nonhamiltonian graphs II , 1992, Graphs Comb..

[2] Yuansheng Yang,et al. On Smallest Maximally Nonhamiltonian Graphs , 1997, Ars Comb..

[3] R. C. Entringer,et al. Smallest maximally nonhamiltonian graphs , 1983 .

[4] Marietjie Frick,et al. Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs , 2007, Discret. Math..

[5] Bohdan Zelinka. Graphs maximal with respect to absence of hamiltonian paths , 1998, Discuss. Math. Graph Theory.

[6] Busiso P. Chisala. On generating snarks , 1998, Discuss. Math. Graph Theory.

[7] J. Bondy. Variations on the Hamiltonian Theme , 1972, Canadian Mathematical Bulletin.

[8] Branko Grünbaum,et al. Vertices Missed by Longest Paths or Circuits , 1974, J. Comb. Theory, Ser. A.