Intersection models of weakly chordal graphs

DOI10.1016/J.DAM.2008.11.017zbMATH Open1197.05098OpenAlexW1981728803MaRDI QIDQ1026105FDOQ1026105

Authors: 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

Recommendations

• Finding Intersection Models of Weakly Chordal Graphs
• What Is between Chordal and Weakly Chordal Graphs?
• Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
• Representing edge intersection graphs of paths on degree 4 trees
• Strong branchwidth and local transversals

zbMATH Keywords

weakly chordal graphedge intersection graph of subtrees on a tree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)

Cites Work

• Efficient graph representations
• Algorithmic graph theory and perfect graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The edge intersection graphs of paths in a tree
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Parallel concepts in graph theory
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree
• The \(k\)-edge intersection graphs of paths in a tree
• A characterisation of rigid circuit graphs
• Optimizing weakly triangulated graphs
• Finding Intersection Models of Weakly Chordal Graphs
• Constant tolerance intersection graphs of subtrees of a tree
• Tolerance intersection graphs on binary trees with constant tolerance 3
• Connectivity threshold for random chordal graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Strong cliques and equistability of EPT graphs
• Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
• Towards a comprehensive theory of conflict-tolerance graphs
• Finding intersection models: from chordal to Helly circular-arc graphs
• Exactly hittable interval graphs
• What Is between Chordal and Weakly Chordal Graphs?
• Strong branchwidth and local transversals
• Recognizing vertex intersection graphs of paths on bounded degree trees
• Finding Intersection Models of Weakly Chordal Graphs

This page was built for publication: Intersection models of weakly chordal graphs

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