A class of strongly perfect graphs

DOI10.1016/0012-365X(85)90070-6zbMath0568.05043MaRDI QIDQ1060228

Myriam Preissmann

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Dilworth numberstrongly perfect graphvicinal preorder

Mathematics Subject Classification ID

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

Related Items (3)

Coloring the cliques of line graphs ⋮ New examples of minimal non-strongly-perfect graphs ⋮ New properties of perfectly orderable graphs and strongly perfect graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Perfectness and Dilworth number
• Meyniel graphs are strongly perfect

This page was built for publication: A class of strongly perfect graphs