Finding Intersection Models of Weakly Chordal Graphs

DOI10.1007/11917496_22zbMath1167.05325OpenAlexW1868173549MaRDI QIDQ3522961

Michal Stern, Marina Lipshteyn, 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 algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 ⋮ What Is between Chordal and Weakly Chordal Graphs? ⋮ A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree ⋮ Intersection models of weakly chordal graphs

This page was built for publication: Finding Intersection Models of Weakly Chordal Graphs