A note on sparseness conditions on chordless vertices of cycles

DOI10.1016/J.DISC.2012.04.017zbMATH Open1277.05097OpenAlexW2072529698MaRDI QIDQ385389FDOQ385389

Authors: Terry A. McKee 

Publication date: 2 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.04.017

Recommendations

• Constrained chords in strongly chordal and distance-hereditary graphs
• Requiring pairwise nonadjacent chords in cycles
• Dirac-type characterizations of graphs without long chordless cycles
• Short-chorded and perfect graphs
• Requiring chords in cycles

zbMATH Keywords

cycleschordal graphchordless vertex

Mathematics Subject Classification ID

Paths and cycles (05C38) Density (toughness, etc.) (05C42)

Cites Work

• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Trivially perfect graphs
• Characterizations of strongly chordal graphs
• Paw-free graphs
• A characterization of ptolemaic graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• The \(i\)-chords of cycles and paths
• Constrained chords in strongly chordal and distance-hereditary graphs
• When every k-cycle has at least f(k) chords

This page was built for publication: A note on sparseness conditions on chordless vertices of cycles

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