Diamond-free circle graphs are Helly circle

DOI10.1016/J.DISC.2009.09.022zbMATH Open1222.05033OpenAlexW2003721214MaRDI QIDQ965965FDOQ965965

Authors Jean Daligault, Daniel Gonçalves, 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)

Recommendations

• Partial characterizations of circle graphs
• Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
• Linear-time recognition of Helly circular-arc models and graphs
• scientific article; zbMATH DE number 2096438
• Proper Helly Circular-Arc Graphs

Cites work

• scientific article; zbMATH DE number 2230199 (Why is no real title available?)
• A characterization of circle graphs
• Circle graph obstructions
• Circle graph obstructions under pivoting
• Circle graphs and monadic second-order logic
• Decomposition of Directed Graphs
• Excluding a bipartite circle graph from line graphs
• Practical and efficient circle graph recognition
• Practical and efficient split decomposition via graph-labelled trees
• Recognition of Circle Graphs
• Recognizing circle graphs in polynomial time
• Reconnaissance des graphes de cordes
• Reducing prime graphs and recognizing circle graphs

Cited in

(6)

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

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

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