Split-neighbourhood graphs and the strong perfect graph conjecture

DOI10.1006/JCTB.1995.1021zbMath0820.05023OpenAlexW1999463304MaRDI QIDQ1892848

Myriam Preissmann, Frédéric Maffray

Publication date: 2 July 1995

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

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

zbMATH Keywords

stable setchromatic numberperfect graphcliqueBerge's strong perfect graph conjecturepolynomially recognizablesplit-neighbourhood

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Coloring perfect degenerate graphs ⋮ Classes of perfect graphs ⋮ Dynamically maintaining split graphs ⋮ On minimal imperfect graphs without induced \(P_5\) ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution

This page was built for publication: Split-neighbourhood graphs and the strong perfect graph conjecture