No antitwins in minimal imperfect graphs

DOI10.1016/0095-8956(88)90071-8zbMath0653.05038OpenAlexW2017872859MaRDI QIDQ1107542

Stephan Olariu

Publication date: 1988

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

Full work available at URL: https://digitalcommons.odu.edu/cgi/viewcontent.cgi?article=1110&context=computerscience_fac_pubs

zbMATH Keywords

minimal imperfect graphtwinsantitwins

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (8)

New classes of Berge perfect graphs ⋮ Bull-free Berge graphs are perfect ⋮ Path parity and perfection ⋮ Wings and perfect graphs ⋮ Some properties of minimal imperfect graphs ⋮ Antitwins in partitionable graphs ⋮ \(P_4\)-domination in minimal imperfect graphs ⋮ Completeness for intersection classes

Cites Work

• Normal hypergraphs and the perfect graph conjecture
• Perfect zero–one matrices
• Unnamed Item

This page was built for publication: No antitwins in minimal imperfect graphs