Square-free perfect graphs.
From MaRDI portal
Publication:1426100
Recommendations
- scientific article; zbMATH DE number 5036055
- Perfect graphs
- scientific article; zbMATH DE number 1455118
- Perfect graphs
- scientific article; zbMATH DE number 3851153
- scientific article; zbMATH DE number 4065042
- On a class of square-free graphs
- A Sum of Squares Characterization of Perfect Graphs
- Almost perfect matrices and graphs.
- A note on perfect graphs
Cites work
- scientific article; zbMATH DE number 3904622 (Why is no real title available?)
- scientific article; zbMATH DE number 2096444 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 915922 (Why is no real title available?)
- A mickey-mouse decomposition theorem
- A theorem of Truemper
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- Articulation sets in linear perfect matrices. II: The wheel theorem and clique articulations
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
- Coloring perfect \((K_ 4\)-e)-free graphs
- Combinatorial optimization. Packing and covering
- Compositions for perfect graphs
- Critical perfect graphs and perfect 3-chromatic graphs
- Decomposition of balanced matrices
- Even-hole-free graphs. I: Decomposition theorem
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- On a class of square-free graphs
- On a property of the class of n-colorable graphs
- On the perfect graph conjecture
- Paw-free graphs
- Recognizing Dart-Free Perfect Graphs
- Some properties of minimal imperfect graphs
- Star-cutsets and perfect graphs
- Structural properties and decomposition of linear balanced matrices
- The strong perfect graph theorem
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
Cited in
(9)- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- scientific article; zbMATH DE number 5036055 (Why is no real title available?)
- Decomposing Berge graphs and detecting balanced skew partitions
- Detecting 2-joins faster
- On cover-structure graphs
- Even pairs in square-free Berge graphs
- Basic perfect graphs and their extensions
- Classes of perfect graphs
- Combinatorial optimization with 2-joins
This page was built for publication: Square-free perfect graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426100)
