The strong perfect graph conjecture: 40 years of attempts, and its resolution
From MaRDI portal
(Redirected from Publication:1045106)
Recommendations
Cites work
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3887730 (Why is no real title available?)
- scientific article; zbMATH DE number 3889564 (Why is no real title available?)
- scientific article; zbMATH DE number 3889583 (Why is no real title available?)
- scientific article; zbMATH DE number 3168327 (Why is no real title available?)
- scientific article; zbMATH DE number 3869356 (Why is no real title available?)
- scientific article; zbMATH DE number 3904622 (Why is no real title available?)
- scientific article; zbMATH DE number 3908479 (Why is no real title available?)
- scientific article; zbMATH DE number 1189243 (Why is no real title available?)
- scientific article; zbMATH DE number 3763984 (Why is no real title available?)
- scientific article; zbMATH DE number 3556145 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 1286503 (Why is no real title available?)
- scientific article; zbMATH DE number 1033822 (Why is no real title available?)
- scientific article; zbMATH DE number 1455118 (Why is no real title available?)
- scientific article; zbMATH DE number 1545651 (Why is no real title available?)
- scientific article; zbMATH DE number 863499 (Why is no real title available?)
- scientific article; zbMATH DE number 3214398 (Why is no real title available?)
- scientific article; zbMATH DE number 3216258 (Why is no real title available?)
- scientific article; zbMATH DE number 3390792 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- A characterization of perfect graphs
- A new property of critical imperfect graphs and some consequences
- A note on even pairs
- A semi-strong perfect graph theorem
- About skew partitions in minimal imperfect graphs
- Algorithms on clique separable graphs
- Almost integral polyhedra related to certain combinatorial optimization problems
- Anti-blocking polyhedra
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
- Berge trigraphs
- Building counterexamples
- Bull-free Berge graphs are perfect
- Chair-free Berge graphs are perfect
- Coloring graphs with stable cutsets
- Coloring perfect \((K_ 4\)-e)-free graphs
- Combinatorial designs related to the strong perfect graph conjecture
- Combinatorial optimization. Packing and covering
- Complete multi-partite cutsets in minimal imperfect graphs
- Compositions for perfect graphs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Counterexamples to three conjectures concerning perfect graphs
- Cutsets in perfect and minimal imperfect graphs
- Decomposition of Directed Graphs
- Decomposition of balanced matrices
- Decomposition of perfect graphs
- Decomposition of regular matroids
- Even pairs and the strong perfect graph conjecture
- Even-hole-free graphs part II: Recognition algorithm
- Even-hole-free graphs. I: Decomposition theorem
- Geometric algorithms and combinatorial optimization
- Graphical properties related to minimal imperfection
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- Holes and dominoes in Meyniel graphs
- How the proof of the strong perfect graph conjecture was found
- Maximum matching and a polyhedron with 0,1-vertices
- Minimal imperfect graphs: A simple approach
- Near-perfect matrices
- Normal hypergraphs and the perfect graph conjecture
- Odd Hole Recognition in Graphs of Bounded Clique Size
- On a property of the class of n-colorable graphs
- On certain polytopes associated with graphs
- On circular critical graphs
- On critical edges in minimal imperfect graphs
- On recognizing integer polyhedra
- On rigid circuit graphs
- On the Shannon capacity of a graph
- On the divisibility of graphs
- On the strong perfect graph conjecture
- Paths, Trees, and Flowers
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- Perfect graphs, partitionable graphs and cutsets
- Perfect zero–one matrices
- Recognizing Berge graphs
- Recognizing claw-free perfect graphs
- Recursive generation of partitionable graphs
- Relaxations of vertex packing
- Some aspects of minimal imperfect graphs
- Some properties of minimal imperfect graphs
- Split-neighbourhood graphs and the strong perfect graph conjecture
- Square-free perfect graphs.
- Stable set bonding in perfect graphs and parity graphs
- Star-cutsets and perfect graphs
- Testing balancedness and perfection of linear matrices
- The connectivity of minimal imperfect graphs
- The ellipsoid method and its consequences in combinatorial optimization
- The strong perfect graph theorem
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- The theta body and imperfection
- The validity of the strong perfect-graph conjecture for (K₄-e)-free graphs
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- Uniquely colorable perfect graphs
- Weakly triangulated graphs
Cited in
(8)- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- How the proof of the strong perfect graph conjecture was found
- On some graph classes related to perfect graphs: a survey
- Strong T-Perfection of Bad-K4 -Free Graphs
- Split digraphs
This page was built for publication: The strong perfect graph conjecture: 40 years of attempts, and its resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045106)
