On the structure of bull-free perfect graphs

DOI10.1007/BF01202235zbMath0869.05028MaRDI QIDQ675887

Oscar Porto, Frédéric Maffray, Celina M. Herrera de Figueiredo

Publication date: 11 May 1997

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

perfect graphperfectly orderable graphbull-free graphBerge graphperfectly contractile graphquasi-parity graphweakly triangulated graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

On dart-free perfectly contractile graphs ⋮ The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs ⋮ Path parity and perfection ⋮ 4-coloring \((P_6, \text{bull})\)-free graphs ⋮ Even pairs in claw-free perfect graphs ⋮ Perfectly contractile graphs and quadratic toric rings ⋮ Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs ⋮ Polynomial cases for the vertex coloring problem ⋮ Maximum weight independent sets in odd-hole-free graphs without dart or without bull ⋮ Transitive orientations in bull-reducible Berge graphs ⋮ The perfection and recognition of bull-reducible Berge graphs ⋮ The structure of bull-free graphs I -- three-edge-paths with centers and anticenters ⋮ The Structure of Bull-Free Perfect Graphs ⋮ Bull-Reducible Berge Graphs are Perfect

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weakly triangulated graphs
• Perfectly contractile graphs
• Perfectly orderable graphs are quasi-parity graphs: a short proof
• Bull-free Berge graphs are perfect
• A new property of critical imperfect graphs and some consequences
• \(P_ 4\)-trees and substitution decomposition
• Optimizing weakly triangulated graphs
• Recognizing bull-free perfect graphs
• On a property of the class of n-colorable graphs
• A Linear Recognition Algorithm for Cographs
• Transformations which Preserve Perfectness and H-Perfectness of Graphs

This page was built for publication: On the structure of bull-free perfect graphs