The structure of imperfect critically strongly-imperfect graphs

DOI10.1016/0012-365X(95)00058-5MaRDI QIDQ1923530zbMATH OpenFDO

Authors Elefterie Olaru

Publication date 26 February 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(95)00058-5

zbMATH Keywords

critically strongly-imperfect graphsstrong perfect graph conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Review text

The author characterizes the critically strongly-imperfect graphs which are imperfect as well. Further, he shows that these are precisely the holes of odd length \(\geq5\) or their complements.

Cites work

• A characterization of perfect graphs
• scientific article; zbMATH DE number 3889565 (Why is no real title available?)
• scientific article; zbMATH DE number 4091540 (Why is no real title available?)

Cited in

(1)

• Graph Imperfection with a Co-Site Constraint

This page was built for publication: The structure of imperfect critically strongly-imperfect graphs

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