论文信息 - More than one tough chordal planar graphs are Hamiltonian

More than one tough chordal planar graphs are Hamiltonian

We prove the result stated in the title. Furthermore, it is proved that for any e > 0, there is a 1-tough chordal planar graph Ge such that the length of a longest cycle of Ge is less than e|V(Ge)|. © 1999 John Wiley & Sons, Inc. J. Graph Theory 32: 405410, 1999

Jochen Harant | Thomas Böhme | Michal Tkáč

[1] Hansjoachim Walther,et al. Shortness Exponents of Families of Graphs , 1973, J. Comb. Theory, Ser. A.

[2] Jochen Harant,et al. Non-hamiltonian 4/5-tough maximal planar graphs , 1995, Discret. Math..

[3] Michael S. Jacobson,et al. Tough enough chordal graphs are hamiltonian , 1998 .

[4] Michal Tkác. On the shortness exponent of 1-tough, maximal planar graphs , 1996, Discret. Math..

[5] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .

[6] Takao Nishizeki. A 1-tough nonhamiltonian maximal planar graph , 1980, Discret. Math..

[7] G. Dirac. On rigid circuit graphs , 1961 .

[8] Hikoe Enomoto,et al. Toughness and the existence of k-factors , 1985, J. Graph Theory.

[9] Michael B. Dillencourt. An upper bound on the shortness exponent of 1-tough, maximal planar graphs , 1991, Discret. Math..

[10] Vasek Chvátal,et al. Tough graphs and hamiltonian circuits , 1973, Discret. Math..