Partial characterizations of circle graphs
From MaRDI portal
Redirect page
Publication:643006
Publication:643006
Redirect to:
Recommendations
Cites work
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 1933269 (Why is no real title available?)
- scientific article; zbMATH DE number 2096438 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3420624 (Why is no real title available?)
- A New Class of Brittle Graphs
- Algorithmic graph theory and perfect graphs
- Circle graph obstructions
- Circle graph obstructions under pivoting
- Decomposition of Directed Graphs
- Detecting a Theta or a Prism
- Diamond-free circle graphs are Helly circle
- Distance-hereditary graphs
- Efficient construction of unit circular-arc models
- Graph Classes: A Survey
- On a property of the class of n-colorable graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- On the problem of domino recognition
- Partial characterizations of circular-arc graphs
- Polynomial time recognition of unit circular-arc graphs
- Recognition of Circle Graphs
- Reconnaissance des graphes de cordes
- Reducing prime graphs and recognizing circle graphs
- Strong tree-cographs are Birkhoff graphs
- Structure theorems for some circular-arc graphs
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
Cited in
(21)- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- scientific article; zbMATH DE number 3970805 (Why is no real title available?)
- Parity in knot theory
- Naji's characterization of circle graphs
- Circle graph obstructions under pivoting
- On forbidden induced subgraphs for unit disk graphs
- Splitting cubic circle graphs
- Notes on a theorem of Naji
- 2-nested matrices: towards understanding the structure of circle graphs
- A characterization of circle graphs
- Partial Characterizations of Circular-Arc Graphs
- Treewidth, Circle Graphs, and Circular Drawings
- Treewidth, circle graphs and circular drawings
- Diamond-free circle graphs are Helly circle
- scientific article; zbMATH DE number 1933269 (Why is no real title available?)
- scientific article; zbMATH DE number 2096438 (Why is no real title available?)
- Partial characterizations of circular-arc graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- scientific article; zbMATH DE number 7528057 (Why is no real title available?)
- Forbidden induced subgraph characterization of circle graphs within split graphs
- Properties of an approximability-related parameter on circular complete graphs
This page was built for publication: Partial characterizations of circle graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643006)