The perfection and recognition of bull-reducible Berge graphs
From MaRDI portal
Recommendations
Cites work
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- Bull-free Berge graphs are perfect
- Bull-free weakly chordal perfectly orderable graphs
- Discs in unbreakable graphs
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 1455118 (Why is no real title available?)
- Normal hypergraphs and the perfect graph conjecture
- On the structure of bull-free perfect graphs
- On the structure of bull-free perfect graphs. II: The weakly chordal case
- Recognizing Berge graphs
- Recognizing bull-free perfect graphs
- Star-cutsets and perfect graphs
- The strong perfect graph theorem
- Topics on perfect graphs
Cited in
(5)
This page was built for publication: The perfection and recognition of bull-reducible Berge graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680732)