On critical edges in minimal imperfect graphs

DOI10.1006/jctb.1996.0034zbMath0855.05062OpenAlexW2155450181MaRDI QIDQ1924138

András Sebő

Publication date: 26 January 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.0034

zbMATH Keywords

stability numberstrong perfect graph conjecturemaximum cliqueminimal imperfect graphscritical edges

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Elementary bipartite graphs and unique colourability ⋮ Chair-free Berge graphs are perfect ⋮ A Berge-keeping operation for graphs ⋮ Coloring planar Toeplitz graphs and the stable set polytope. ⋮ Cayley partitionable graphs and near-factorizations of finite groups ⋮ Forced color classes, intersection graphs and the strong perfect graph conjecture ⋮ \(P_4\)-domination in minimal imperfect graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution