The validity of the strong perfect-graph conjecture for (K₄-e)-free graphs
From MaRDI portal
(Redirected from Publication:754232)
The validity of the strong perfect-graph conjecture for \((K 4-e)\)-free graphs
The validity of the strong perfect-graph conjecture for \((K 4-e)\)-free graphs
Cited in
(20)- Perfectness of normal products of graphs
- Addendum to: M. Conforti and M. R. Rao, ``Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, Discrete Mathematics 104 (1992) 23--47
- Testing balancedness and perfection of linear matrices
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
- The edge intersection graphs of paths in a tree
- Quasi-star-cutsets and some consequences
- Odd cycles and matrices with integrality properties
- Two classes of perfect graphs
- Generalized perfect graphs: Characterizations and inversion
- Even and odd pairs in linegraphs of bipartite graphs
- Chair-free Berge graphs are perfect
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- scientific article; zbMATH DE number 2230322 (Why is no real title available?)
- Coloring perfect \((K_ 4\)-e)-free graphs
- Perfect product graphs
- Classes of perfect graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- On a Class of P 5 -Free Graphs
- Some properties of minimal imperfect graphs
- The strong perfect graph conjecture holds for diamonded odd cycle-free graphs
This page was built for publication: The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754232)
