Diamond-free circle graphs are Helly circle

DOI10.1016/j.disc.2009.09.022zbMath1222.05033OpenAlexW2003721214MaRDI QIDQ965965

Daniel Gonçalves, Jean Daligault, Michaël Rao

Publication date: 27 April 2010

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

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00432897/file/HellyCircle_submitted.pdf

zbMATH Keywords

Helly propertycircle graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Notes on a theorem of Naji ⋮ On neighborhood-Helly graphs ⋮ Partial characterizations of circle graphs ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Splitting cubic circle graphs ⋮ Forbidden induced subgraph characterization of circle graphs within split graphs

Cites Work

• Unnamed Item
• Practical and efficient circle graph recognition
• Practical and efficient split decomposition via graph-labelled trees
• A characterization of circle graphs
• Circle graphs and monadic second-order logic
• Reconnaissance des graphes de cordes
• Reducing prime graphs and recognizing circle graphs
• Circle graph obstructions
• Excluding a bipartite circle graph from line graphs
• Circle graph obstructions under pivoting
• Decomposition of Directed Graphs
• Recognition of Circle Graphs
• Recognizing circle graphs in polynomial time

This page was built for publication: Diamond-free circle graphs are Helly circle