The strong perfect graph conjecture holds for diamonded odd cycle-free graphs
From MaRDI portal
(Redirected from Publication:1208345)
adjacency matrixbipartite graphincidence matrixstrong perfect graph conjectureperfect matricesdiamonded odd cyclestar cut set
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Recommendations
Cites work
- scientific article; zbMATH DE number 3887724 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3322855 (Why is no real title available?)
- Balanced matrices
- Coloring perfect \((K_ 4\)-e)-free graphs
- Properties of balanced and perfect matrices
- Star-cutsets and perfect graphs
- Structural properties and decomposition of linear balanced matrices
- Structure theorems for some circular-arc graphs
- The Strong Perfect Graph Conjecture for Planar Graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- The validity of the strong perfect-graph conjecture for (K₄-e)-free graphs
Cited in
(7)- Strong cliques in diamond-free graphs
- A proof of Hougardy's conjecture for diamond-free graphs
- Odd cycles and matrices with integrality properties
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- scientific article; zbMATH DE number 2192137 (Why is no real title available?)
- Families of graphs complete for the strong perfect graph Conjecture
- Classes of perfect graphs
This page was built for publication: The strong perfect graph conjecture holds for diamonded odd cycle-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208345)
