When every k-cycle has at least f(k) chords

DOI10.1002/JGT.20547zbMath1250.05063OpenAlexW2006785792MaRDI QIDQ3174243

Terry A. McKee

Publication date: 12 October 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20547

zbMATH Keywords

cyclechordcographchoral graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

A note on sparseness conditions on chordless vertices of cycles

Cites Work

• Unnamed Item
• Complement reducible graphs
• A characterization of ptolemaic graphs
• Topics in Intersection Graph Theory
• Graph Classes: A Survey

This page was built for publication: When every k-cycle has at least f(k) chords