Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
From MaRDI portal
Publication:1837210
Cites work
- scientific article; zbMATH DE number 3884202 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3910416 (Why is no real title available?)
- scientific article; zbMATH DE number 3390792 (Why is no real title available?)
- scientific article; zbMATH DE number 3420624 (Why is no real title available?)
- A characterization of perfect graphs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Almost integral polyhedra related to certain combinatorial optimization problems
- Coloring a Family of Circular Arcs
- Combinatorial designs related to the strong perfect graph conjecture
- Critical perfect graphs and perfect 3-chromatic graphs
- Graphical properties related to minimal imperfection
- Normal hypergraphs and the perfect graph conjecture
- On the strong perfect graph conjecture
- Perfect zero–one matrices
- The Strong Perfect Graph Conjecture for Planar Graphs
- The strong perfect graph conjecture for toroidal graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs
Cited in
(4)
This page was built for publication: Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837210)