Recommendations
Cited in
(58)- Coloring perfect \((K_ 4\)-e)-free graphs
- A note on perfect graphs
- A semi-strong perfect graph theorem
- Locally perfect graphs
- No antitwins in minimal imperfect graphs
- The strong perfect graph conjecture for pan-free graphs
- All variations on perfectly orderable graphs
- On the \(P_ 4\)-structure of perfect graphs. III: Partner decompositions
- Some properties of minimal imperfect graphs
- On the complexity of testing for odd holes and induced odd paths
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- The strong perfect graph conjecture holds for diamonded odd cycle-free graphs
- Articulation sets in linear perfect matrices. II: The wheel theorem and clique articulations
- On minimal imperfect graphs without induced P₅
- On Tucker vertices of graphs
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
- New classes of Berge perfect graphs
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- Quasi-parity and perfect graphs
- Chair-free Berge graphs are perfect
- On the closure of graphs under substitution
- Progress on perfect graphs
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- On the \(P_ 4\)-structure of perfect graphs. IV: Partner graphs
- A generalization of Chvátal's star-cutset lemma
- Two conjectures equivalent to the perfect graph conjecture
- A transformation which preserves the clique number
- Strongly perfect infinite graphs
- A characterization of some graph classes with no long holes
- A new class of perfect Hoàng graphs
- Even pairs and the strong perfect graph conjecture
- On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs
- On the sibling-structure of perfect graphs
- Towards a constructive formalization of perfect graph theorems
- Two-colourings that decompose perfect graphs
- Perfect graphs
- scientific article; zbMATH DE number 3885936 (Why is no real title available?)
- scientific article; zbMATH DE number 3887724 (Why is no real title available?)
- scientific article; zbMATH DE number 3887731 (Why is no real title available?)
- Perfect coloring and linearly χ-boundP6-free graphs
- On a Class of P 5 -Free Graphs
- scientific article; zbMATH DE number 4158667 (Why is no real title available?)
- scientific article; zbMATH DE number 3902681 (Why is no real title available?)
- Families of graphs complete for the strong perfect graph Conjecture
- scientific article; zbMATH DE number 497609 (Why is no real title available?)
- On the two‐edge‐colorings of perfect graphs
- scientific article; zbMATH DE number 1789914 (Why is no real title available?)
- scientific article; zbMATH DE number 4116566 (Why is no real title available?)
- Recursive generation of partitionable graphs
- scientific article; zbMATH DE number 846970 (Why is no real title available?)
- scientific article; zbMATH DE number 915922 (Why is no real title available?)
- Structure of super strongly perfect graphs
- Chromatic and clique numbers of a class of perfect graphs
- Cycle-perfect graphs are perfect
- A structural property of monsters
- scientific article; zbMATH DE number 2192137 (Why is no real title available?)
- On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs
- On the divisibility of graphs
This page was built for publication: On the strong perfect graph conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5903942)
