On the strong perfect graph conjecture and critical graphs

DOI10.1016/0012-365X(82)90086-3zbMath0487.05028WikidataQ122920400 ScholiaQ122920400MaRDI QIDQ1165250

O. T. George, M. R. Sridharan

Publication date: 1982

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

zbMATH Keywords

chromatic numberperfect graphchordless circuitmaximal clique size

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Cites Work

• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Critical perfect graphs and perfect 3-chromatic graphs
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the strong perfect graph conjecture and critical graphs