Requiring adjacent chords in cycles

DOI10.1142/S1793830918500039MaRDI QIDQ4603869zbMATH OpenOpenAlexFDO

Authors 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

adjacent chordschordal graphcrossing chordsdistance-hereditary graph

Mathematics Subject Classification ID

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

Recommendations

• Requiring pairwise nonadjacent chords in cycles
• Requiring chords in cycles
• Constrained chords in strongly chordal and distance-hereditary graphs
• Double-crossed chords and distance-hereditary graphs
• The i-chords of cycles and paths

Cites work

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

Cited in

(3)

• Requiring chords in cycles
• Constrained chords in strongly chordal and distance-hereditary graphs
• Requiring pairwise nonadjacent chords in cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603869)