Requiring chords in cycles

DOI10.1016/j.disc.2005.04.009zbMath1070.05056OpenAlexW1996041495MaRDI QIDQ2566156

Terry A. McKee

Publication date: 22 September 2005

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

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

zbMATH Keywords

Chordal graphStrongly chordal graphChordal bipartite graphDistance-hereditary graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

Chordal multipartite graphs and chordal colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizations of strongly chordal graphs
• Distance-hereditary graphs
• On the null-homotopy of bridged graphs
• On simple characterizations of k-trees
• Dirac-type characterizations of graphs without long chordless cycles
• Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Topics in Intersection Graph Theory
• Disjoint clique cutsets in graphs without long holes

This page was built for publication: Requiring chords in cycles