What Is between Chordal and Weakly Chordal Graphs?

DOI10.1007/978-3-540-92248-3_25zbMath1202.05091OpenAlexW1812360438MaRDI QIDQ5302062

Michal Stern, Marina Lipshteyn, Elad Cohen, Martin Charles Golumbic

Publication date: 20 January 2009

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_25

zbMATH Keywords

chordal graphsmaximum degreegraph representation

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 ⋮ The vertex leafage of chordal graphs ⋮ Towards a comprehensive theory of conflict-tolerance graphs ⋮ Recognizing vertex intersection graphs of paths on bounded degree trees

Cites Work

• Unnamed Item
• Unnamed Item
• The edge intersection graphs of paths in a tree
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree
• Connectivity threshold for random chordal graphs
• A recognition algorithm for the intersection graphs of paths in trees
• Constant tolerance intersection graphs of subtrees of a tree
• Optimizing weakly triangulated graphs
• A characterisation of rigid circuit graphs
• Tolerance intersection graphs on binary trees with constant tolerance 3
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Finding Intersection Models of Weakly Chordal Graphs