The structure of bull-free perfect graphs
From MaRDI portal
Publication:2852609
Recommendations
Cites work
- Bull-free Berge graphs are perfect
- Coloring Bull-Free Perfectly Contractile Graphs
- Compositions for perfect graphs
- On the structure of bull-free perfect graphs
- Optimizing Bull-Free Perfect Graphs
- Recognizing Berge graphs
- Recognizing bull-free perfect graphs
- The strong perfect graph theorem
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
- The structure of bull-free graphs II and III -- a summary
Cited in
(11)- On the structure of bull-free perfect graphs. II: The weakly chordal case
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
- The structure of bull-free graphs II and III -- a summary
- Bull-free Berge graphs are perfect
- Coloring bull-free perfect graphs
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- Optimizing Bull-Free Perfect Graphs
- Recognizing bull-free perfect graphs
- On the structure of bull-free perfect graphs
- Critical (\(P_5\), bull)-free graphs
- The Erdős-Hajnal conjecture for bull-free graphs
This page was built for publication: The structure of bull-free perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852609)