Planar Hamiltonian chordal graphs are cycle extendable

DOI10.1016/S0012-365X(02)00505-8zbMath1015.05039OpenAlexW2074400856MaRDI QIDQ1850025

Tao Jiang

Publication date: 2 December 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00505-8

zbMATH Keywords

planarchordalcycle extendable

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs ⋮ Toughness and Hamiltonicity of strictly chordal graphs ⋮ Hamiltonian properties of locally connected graphs with bounded vertex degree ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On the \(H\)-force number of Hamiltonian graphs and cycle extendability ⋮ Cycle extendability in graphs and digraphs ⋮ Cycle Extendability of Hamiltonian Strongly Chordal Graphs ⋮ Cycle Extensions in BIBD Block-Intersection Graphs ⋮ Hamiltonian Chordal Graphs are not Cycle Extendable

This page was built for publication: Planar Hamiltonian chordal graphs are cycle extendable