Finding intersection models: from chordal to Helly circular-arc graphs

DOI10.1016/j.disc.2011.11.036zbMath1238.05179OpenAlexW1988648864MaRDI QIDQ409451

Liliana Alcón, Marisa Gutierrez

Publication date: 13 April 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.036

zbMATH Keywords

chordal graphsHelly circular-arc graphsclique-treeintersection models

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Intersection graphs of concatenable subtrees of graphs
• Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
• A characterisation of rigid circuit graphs
• Restricted circular-arc graphs and clique cycles
• Algorithmic graph theory and perfect graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representations of chordal graphs as subtrees of a tree
• Power of Natural Semijoins
• Algorithms on circular-arc graphs
• Topics in Intersection Graph Theory
• Graph Classes: A Survey

This page was built for publication: Finding intersection models: from chordal to Helly circular-arc graphs