What Is between Chordal and Weakly Chordal Graphs?

DOI10.1007/978-3-540-92248-3_25MaRDI QIDQ5302062zbMATH OpenOpenAlexFDO

Authors Elad Cohen, Marina Lipshteyn, Michal Stern, 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 graphsgraph representationmaximum degree

Mathematics Subject Classification ID

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

Recommendations

• Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
• Intersection models of weakly chordal graphs
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree
• Finding Intersection Models of Weakly Chordal Graphs
• Tree representations of graphs

Cites work

• A characterisation of rigid circuit graphs
• A recognition algorithm for the intersection graphs of paths in trees
• Connectivity threshold for random chordal graphs
• Constant tolerance intersection graphs of subtrees of a tree
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree
• Finding Intersection Models of Weakly Chordal Graphs
• scientific article; zbMATH DE number 2117210 (Why is no real title available?)
• Optimizing weakly triangulated graphs
• Recognizing weakly triangulated graphs by edge separability
• The edge intersection graphs of paths in a tree
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Tolerance intersection graphs on binary trees with constant tolerance 3

Cited in

(6)

• Intersection models of weakly chordal graphs
• Towards a comprehensive theory of conflict-tolerance graphs
• Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
• The vertex leafage of chordal graphs
• Finding Intersection Models of Weakly Chordal Graphs
• Recognizing vertex intersection graphs of paths on bounded degree trees

This page was built for publication: What Is between Chordal and Weakly Chordal Graphs?

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