Bull-free Berge graphs are perfect
From MaRDI portal
Publication:1095938
DOI10.1007/BF01788536zbMath0633.05056OpenAlexW2049480048WikidataQ56430119 ScholiaQ56430119MaRDI QIDQ1095938
Publication date: 1987
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788536
Related Items (52)
On the vertex packing problem ⋮ Most unbreakable murky graphs are bull-free ⋮ Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) ⋮ Recognizing bull-free perfect graphs ⋮ Fast Skew Partition Recognition ⋮ Path parity and perfection ⋮ A new class of perfect Hoàng graphs ⋮ A nice class for the vertex packing problem ⋮ Two classes of perfect graphs ⋮ Chair-free Berge graphs are perfect ⋮ Some properties of minimal imperfect graphs ⋮ Counting List Matrix Partitions of Graphs ⋮ The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect ⋮ Asymptotics of the chromatic number for quasi-line graphs ⋮ Amalgams and χ-Boundedness ⋮ Algorithmic aspects of switch cographs ⋮ A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) ⋮ Classes of perfect graphs ⋮ On the closure of triangle-free graphs under substitution ⋮ Finding a smallest odd hole in a claw-free graph using global structure ⋮ Substitution and \(\chi\)-boundedness ⋮ Computing \(H\)-joins with application to 2-modular decomposition ⋮ Polynomial cases for the vertex coloring problem ⋮ Hamiltonicity in claw-free graphs ⋮ Total domination edge critical graphs with total domination number three and many dominating pairs ⋮ Decomposing Berge graphs and detecting balanced skew partitions ⋮ Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey ⋮ Graph parameters measuring neighbourhoods in graphs-bounds and applications ⋮ An algorithm for finding homogeneous pairs ⋮ On the structure of bull-free perfect graphs ⋮ Claw-free graphs. IV: Decomposition theorem ⋮ Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs ⋮ Transitive orientations in bull-reducible Berge graphs ⋮ Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs ⋮ Skew partitions in perfect graphs ⋮ Stability number of bull- and chair-free graphs ⋮ On perfect switching classes ⋮ The perfection and recognition of bull-reducible Berge graphs ⋮ Bounding χ in terms of ω and Δ for quasi-line graphs ⋮ Combinatorial optimization with 2-joins ⋮ The structure of bull-free graphs I -- three-edge-paths with centers and anticenters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On perfect switching classes ⋮ Complexity of clique-coloring odd-hole-free graphs ⋮ On minimal imperfect graphs without induced \(P_5\) ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ The Structure of Bull-Free Perfect Graphs ⋮ A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs ⋮ A description of claw-free perfect graphs ⋮ A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs ⋮ Bull-Reducible Berge Graphs are Perfect
Cites Work
This page was built for publication: Bull-free Berge graphs are perfect
