Recommendations
- The structure of bull-free perfect graphs
- On the structure of bull-free perfect graphs
- Recognizing bull-free perfect graphs
- Almost all Berge Graphs are Perfect
- The perfection and recognition of bull-reducible Berge graphs
- Coloring bull-free perfect graphs
- Chair-free Berge graphs are perfect
- scientific article; zbMATH DE number 861423
- Optimizing Bull-Free Perfect Graphs
- On the structure of bull-free perfect graphs. II: The weakly chordal case
Cites work
Cited in
(54)- Amalgams and \(\chi\)-boundedness
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- A description of claw-free perfect graphs
- Total domination edge critical graphs with total domination number three and many dominating pairs
- Fast Skew Partition Recognition
- An algorithm for finding homogeneous pairs
- On perfect switching classes
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Finding a smallest odd hole in a claw-free graph using global structure
- Graph parameters measuring neighbourhoods in graphs-bounds and applications
- On the vertex packing problem
- Stability number of bull- and chair-free graphs
- On perfect switching classes
- On the closure of triangle-free graphs under substitution
- On the structure of bull-free perfect graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Algorithmic aspects of switch cographs
- Hamiltonicity in claw-free graphs
- Two classes of perfect graphs
- Most unbreakable murky graphs are bull-free
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
- The Erdős-Hajnal conjecture for bull-free graphs
- scientific article; zbMATH DE number 1445285 (Why is no real title available?)
- A new class of perfect Hoàng graphs
- Bounding χ in terms of ω and Δ for quasi-line graphs
- The perfection and recognition of bull-reducible Berge graphs
- Recognizing bull-free perfect graphs
- Polynomial cases for the vertex coloring problem
- Decomposing Berge graphs and detecting balanced skew partitions
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- Some properties of minimal imperfect graphs
- Skew partitions in perfect graphs
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
- The structure of bull-free perfect graphs
- On the structure of bull-free perfect graphs. II: The weakly chordal case
- On minimal imperfect graphs without induced \(P_5\)
- Claw-free graphs. IV: Decomposition theorem
- Counting List Matrix Partitions of Graphs
- Bull-Reducible Berge Graphs are Perfect
- Computing \(H\)-joins with application to 2-modular decomposition
- Complexity of clique-coloring odd-hole-free graphs
- Transitive orientations in bull-reducible Berge graphs
- A nice class for the vertex packing problem
- Classes of perfect graphs
- Combinatorial optimization with 2-joins
- scientific article; zbMATH DE number 2230220 (Why is no real title available?)
- A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
- Path parity and perfection
- Substitution and \(\chi\)-boundedness
- Chair-free Berge graphs are perfect
- scientific article; zbMATH DE number 2230322 (Why is no real title available?)
This page was built for publication: Bull-free Berge graphs are perfect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095938)
