Partial characterizations of circle graphs
From MaRDI portal
Publication:643006
DOI10.1016/j.dam.2010.06.020zbMath1228.05243MaRDI QIDQ643006
Guillermo Durán, Luciano N. Grippo, Martín D. Safe, Flavia Bonomo-Braberman
Publication date: 27 October 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/129447
circle graphs; \(P_{4}\)-tidy graphs; Helly circle graphs; linear domino graphs; tree-cographs; unit circle graphs
Related Items
Notes on a theorem of Naji, Splitting cubic circle graphs, Forbidden induced subgraph characterization of circle graphs within split graphs, 2-nested matrices: towards understanding the structure of circle graphs, Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diamond-free circle graphs are Helly circle
- Reconnaissance des graphes de cordes
- Distance-hereditary graphs
- Reducing prime graphs and recognizing circle graphs
- Strong tree-cographs are Birkhoff graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- Circle graph obstructions
- Algorithmic graph theory and perfect graphs
- On a property of the class of n-colorable graphs
- Structure theorems for some circular-arc graphs
- Detecting a Theta or a Prism
- On the problem of domino recognition
- A New Class of Brittle Graphs
- Efficient construction of unit circular-arc models
- Circle graph obstructions under pivoting
- Partial characterizations of circular-arc graphs
- Decomposition of Directed Graphs
- Graph Classes: A Survey
- Recognition of Circle Graphs
- Polynomial time recognition of unit circular-arc graphs
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Detecting induced subgraphs
