2-connected claw-free chordal graphs are cycle extendable

Deborah Arangno, David E. Brown

A cycle $C$ of length $k$ in graph $G$ is extendable if there is another cycle $C^{\prime }$ in $G$ with $V(C)\subset V(C^{\prime })$ and length $k+1$. A graph is cycle extendable if every non-Hami…