Requiring adjacent chords in cycles

DOI10.1142/S1793830918500039zbMath1380.05168OpenAlexW2766941419MaRDI QIDQ4603869

Terry A. McKee

Publication date: 23 February 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500039

zbMATH Keywords

chordal graphdistance-hereditary graphcrossing chordsadjacent chords

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Requiring pairwise nonadjacent chords in cycles
• Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs
• Distance-hereditary graphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Graph Classes: A Survey
• Edge cycle extendable graphs
• Almost distance-hereditary graphs

This page was built for publication: Requiring adjacent chords in cycles