The strong perfect graph conjecture holds for diamonded odd cycle-free graphs

DOI10.1016/0012-365X(92)90697-EzbMath0778.05069WikidataQ122924544 ScholiaQ122924544MaRDI QIDQ1208345

Olivia M. Carducci

Publication date: 16 May 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphincidence matrixadjacency matrixstrong perfect graph conjectureperfect matricesdiamonded odd cyclestar cut set

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Classes of perfect graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs
• Coloring perfect \((K_ 4\)-e)-free graphs
• Star-cutsets and perfect graphs
• Properties of balanced and perfect matrices
• Structural properties and decomposition of linear balanced matrices
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Structure theorems for some circular-arc graphs
• Balanced matrices
• The Strong Perfect Graph Conjecture for Planar Graphs