On transversals in minimal imperfect graphs

DOI10.1016/S0012-365X(96)00178-1MaRDI QIDQ1356752zbMATH OpenWikidataFDO

Authors Jean-Luc Fouquet, Frédéric Maire, Irena Rusu, Henri Thuillier

Publication date 20 October 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(96)00178-1

zbMATH Keywords

cliqueminimal imperfect graphsstabilitystrong perfect graph conjecture

Mathematics Subject Classification ID

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

Review text

The authors show that for graphs of diameter at least 7, the strong perfect graph conjecture is equivalent to the conjecture that minimal imperfect graphs admit no small 2-transversals.

Cites work

• A characterization of perfect graphs
• Combinatorial designs related to the strong perfect graph conjecture
• Critical perfect graphs and perfect 3-chromatic graphs
• Graphical properties related to minimal imperfection
• scientific article; zbMATH DE number 3869356 (Why is no real title available?)
• scientific article; zbMATH DE number 3902681 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• Perfect zero–one matrices

This page was built for publication: On transversals in minimal imperfect graphs

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