The connectivity of minimal imperfect graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199609)23:1<77::AID-JGT9>3.0.CO;2-H" /><77::AID-JGT9>3.0.CO;2-H 10.1002/(SICI)1097-0118(199609)23:1<77::AID-JGT9>3.0.CO;2-HzbMath0859.05058OpenAlexW2138817188MaRDI QIDQ4892346

András Sebő

Publication date: 15 September 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199609)23:1<77::aid-jgt9>3.0.co;2-h

zbMATH Keywords

stable setconnectivitypartitionable graphminimal imperfect graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (7)

A Berge-keeping operation for graphs ⋮ An approach to solving \(A^{k}=J-I\) ⋮ Disjoint clique cutsets in graphs without long holes ⋮ Structure of cubic Lehman matrices ⋮ On minimal imperfect graphs without induced \(P_5\) ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ Quasi-star-cutsets and some consequences

This page was built for publication: The connectivity of minimal imperfect graphs