Toughness and Hamiltonicity of a class of planar graphs

T. Gerlach
2004 Discrete Mathematics  
A graph G is called chordal if every cycle of G of length at least four has a chord. By a theorem of B ohme, Harant and Tkà aÄ c more than 1-tough chordal planar graphs are Hamiltonian. We prove that this is even true for more than 1-tough planar graphs under the weaker assumption that separating cycles of length at least four have chords.
doi:10.1016/j.disc.2003.11.046 fatcat:utdlld4j7fbphi4w456es5ufgu