On the strong perfect graph conjecture and critical graphs

DOI10.1016/0012-365X(82)90086-3MaRDI QIDQ1165250zbMATH OpenWikidataFDO

Authors M. R. Sridharan, O. T. George

Publication date 1982

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(82)90086-3

zbMATH Keywords

chordless circuitchromatic numbermaximal clique sizeperfect graph

Mathematics Subject Classification ID

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

Cites work

• A characterization of perfect graphs
• Critical perfect graphs and perfect 3-chromatic graphs
• scientific article; zbMATH DE number 3322855 (Why is no real title available?)
• scientific article; zbMATH DE number 3382402 (Why is no real title available?)
• scientific article; zbMATH DE number 3390792 (Why is no real title available?)
• Normal hypergraphs and the perfect graph conjecture
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165250)