Intersection models of weakly chordal graphs

DOI10.1016/j.dam.2008.11.017zbMath1197.05098MaRDI QIDQ1026105

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Publication date: 24 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.11.017

zbMATH Keywords

weakly chordal graph; edge intersection graph of subtrees on a tree

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C75: Structural characterization of families of graphs

05C85: Graph algorithms (graph-theoretic aspects)

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Parallel concepts in graph theory
• Efficient graph representations
• Constant tolerance intersection graphs of subtrees of a tree
• Optimizing weakly triangulated graphs
• A characterisation of rigid circuit graphs
• Algorithmic graph theory and perfect graphs
• Tolerance intersection graphs on binary trees with constant tolerance 3
• The \(k\)-edge intersection graphs of paths in a tree
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Finding Intersection Models of Weakly Chordal Graphs