Rank inequalities for chordal graphs

DOI10.1016/0012-365X(93)90511-QzbMath0774.05055OpenAlexW1995085945MaRDI QIDQ2366014

Ko-Wei Lih

Publication date: 29 June 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90511-q

zbMATH Keywords

pathscycleintersection graphtreescliquechordal graphsinterval graphsconnected graphsextent

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

Minimum Average Distance Clique Trees

Cites Work

• Unnamed Item
• Clique graphs of time graphs
• A characterisation of rigid circuit graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representations of chordal graphs as subtrees of a tree
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Rank inequalities for chordal graphs