The structure of bull-free perfect graphs
From MaRDI portal
Publication:2852609
DOI10.1002/JGT.21688zbMATH Open1272.05060OpenAlexW1603527398MaRDI QIDQ2852609FDOQ2852609
Authors: Maria Chudnovsky, Irena Penev 
Publication date: 9 October 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21688
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Perfect graphs (05C17)
Cites Work
- 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
- The strong perfect graph theorem
- Recognizing Berge graphs
- Recognizing bull-free perfect graphs
- Compositions for perfect graphs
- Optimizing Bull-Free Perfect Graphs
- Bull-free Berge graphs are perfect
- On the structure of bull-free perfect graphs
- Coloring Bull-Free Perfectly Contractile Graphs
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)
