Perfectness and Dilworth number

DOI10.1016/0012-365X(83)90064-XzbMath0518.05053OpenAlexW2077788611MaRDI QIDQ1053715

J. Blot

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90064-x

zbMATH Keywords

chromatic numberclique numberperfect graphinduced subgraphDilworth number

Mathematics Subject Classification ID

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

Related Items (2)

On pairwise compatibility graphs having Dilworth number \(k\) ⋮ A class of strongly perfect graphs

Cites Work

• Unnamed Item
• Normal hypergraphs and the perfect graph conjecture
• Threshold characterization of graphs with dilworth number two

This page was built for publication: Perfectness and Dilworth number