A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Planar Hamiltonian chordal graphs are cycle extendable
2002
Discrete Mathematics
Preserved Fulltext
and |V (C )| = |V (C)| + 1. A graph G is cycle extendable if G contains at least one cycle and every non-Hamiltonian cycle in G is extendable. Hendry (Discrete Math. 85 (1990) 59) asked if every Hamiltonian chordal graph is cycle extendable. We prove that every planar Hamiltonian chordal graph is cycle extendable.
doi:10.1016/s0012-365x(02)00505-8
fatcat:5wj4zroievfzdplvm63rdmqsje