Planar Hamiltonian chordal graphs are cycle extendable
type: Item
instance of: scholarly article
title: Planar Hamiltonian chordal graphs are cycle extendable
zbMATH Open document ID: 1015.05039
DOI: 10.1016/S0012-365X(02)00505-8
author: Tao Jiang
published in: Discrete Mathematics
publication date: 2002-12-02T00:00:00Z
review text: A graph \(G\) is cycle extendable if each cycle of \(G\) is contained in a cycle with one additional vertex and \(G\) has at least one cycle, and \(G\) is chordal if each cycle with at least four vertices has a chord. \textit{G. R. T. Hendry} [Discrete Math. 85, 59-72 (1990; Zbl 0714.05038)] conjectured that a Hamiltonian chordal graph is cycle extendable. Support for this conjecture is given by proving that every planar Hamiltonian chordal graph is cycle extendable.
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1839005
zbMATH Keywords: planar
zbMATH Keywords: chordal
zbMATH Keywords: cycle extendable
reviewed by: Ralph Faudree
MaRDI profile type: Publication
full work available at URL: s0012-365x(02)00505-8
OpenAlex ID: W2074400856
description: scientific article; zbMATH DE number 1839005