The Structure of Bull-Free Perfect Graphs

DOI10.1002/jgt.21688zbMath1272.05060OpenAlexW1603527398MaRDI QIDQ2852609

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

zbMATH Keywords

perfect graphsbull-free graphsstructure theorem

Mathematics Subject Classification ID

Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

The Erdős-Hajnal conjecture for bull-free graphs ⋮ An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs

Cites Work

• On the structure of bull-free perfect graphs
• 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
• Bull-free Berge graphs are perfect
• Recognizing bull-free perfect graphs
• Compositions for perfect graphs
• Recognizing Berge graphs
• Coloring Bull-Free Perfectly Contractile Graphs
• Optimizing Bull-Free Perfect Graphs

This page was built for publication: The Structure of Bull-Free Perfect Graphs