Finding Intersection Models of Weakly Chordal Graphs

DOI10.1007/11917496_22MaRDI QIDQ3522961zbMATH OpenOpenAlexFDO

Authors Marina Lipshteyn, Michal Stern, Martin Charles Golumbic

Publication date 4 September 2008

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

Full work available at URL https://doi.org/10.1007/11917496_22

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• 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

Cited in

(6)

• Intersection models of weakly chordal graphs
• Strong branchwidth and local transversals
• A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree
• Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
• Finding intersection models: from chordal to Helly circular-arc graphs
• What Is between Chordal and Weakly Chordal Graphs?

This page was built for publication: Finding 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 Q3522961)