On the structure of bull-free perfect graphs
From MaRDI portal
Publication:675887
DOI10.1007/BF01202235zbMATH Open0869.05028MaRDI QIDQ675887FDOQ675887
Authors: Frédéric Maffray, Oscar Porto, Celina M. H. de Figueiredo 
Publication date: 11 May 1997
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
- Path parity and perfection
- The structure of bull-free perfect graphs
- scientific article; zbMATH DE number 861423
- Recognizing bull-free perfect graphs
- On the structure of bull-free perfect graphs. II: The weakly chordal case
- Even pairs in claw-free perfect graphs
- Optimizing Bull-Free Perfect Graphs
- scientific article; zbMATH DE number 5130731
- Even pairs
- Clique-coloring some classes of odd-hole-free graphs
perfect graphperfectly orderable graphbull-free graphBerge graphperfectly contractile graphquasi-parity graphweakly triangulated graph
Cites Work
- Title not available (Why is that?)
- Weakly triangulated graphs
- \(P_ 4\)-trees and substitution decomposition
- Recognizing bull-free perfect graphs
- A Linear Recognition Algorithm for Cographs
- Title not available (Why is that?)
- Perfectly contractile graphs
- Title not available (Why is that?)
- On a property of the class of n-colorable graphs
- Bull-free Berge graphs are perfect
- Optimizing weakly triangulated graphs
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- A new property of critical imperfect graphs and some consequences
- Perfectly orderable graphs are quasi-parity graphs: a short proof
Cited In (19)
- Bull-Reducible Berge Graphs are Perfect
- Transitive orientations in bull-reducible Berge graphs
- Even pairs in claw-free perfect graphs
- On dart-free perfectly contractile graphs
- Bull-free weakly chordal perfectly orderable graphs
- On the structure of bull-free perfect graphs. II: The weakly chordal case
- Path parity and perfection
- The maximum weight stable set problem in (\(P_6\), bull)-free graphs
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
- Bull-free Berge graphs are perfect
- Coloring Bull-Free Perfectly Contractile Graphs
- 4-coloring \((P_6, \text{bull})\)-free graphs
- The structure of bull-free perfect graphs
- Recognizing bull-free perfect graphs
- Perfectly contractile graphs and quadratic toric rings
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs
- The perfection and recognition of bull-reducible Berge graphs
- Polynomial cases for the vertex coloring problem
This page was built for publication: On 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 Q675887)
