The structure of bull-free graphs II and III -- a summary

DOI10.1016/J.JCTB.2011.07.002MaRDI QIDQ765203zbMATH OpenOpenAlexFDO

Authors Maria Chudnovsky

Publication date 19 March 2012

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2011.07.002

zbMATH Keywords

induced subgraphgraph structurebull-free graphs

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Perfect graphs (05C17)

Recommendations

• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
• The structure of bull-free perfect graphs
• The Erdős-Hajnal conjecture for bull-free graphs
• Critical (\(P_5\), bull)-free graphs
• Optimizing Bull-Free Perfect Graphs

Cites work

• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters

Cited in

(30)

• Critical (\(P_5\), bull)-free graphs
• The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
• Maximum weight independent sets in odd-hole-free graphs without dart or without bull
• Total domination edge critical graphs with total domination number three and many dominating pairs
• Clique‐width: Harnessing the power of atoms
• Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
• The Doyen-Wilson theorem for bull designs
• Improved FPT algorithms for weighted independent set in bull-free graphs
• Graphs of separability at most two: structural characterizations and their consequences
• Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs
• The maximum weight stable set problem in (\(P_6\), bull)-free graphs
• Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
• Stability number of bull- and chair-free graphs revisited
• The Erdős-Hajnal conjecture for bull-free graphs
• Finding matching cuts in \(H\)-free graphs
• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
• Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
• The structure of bull-free perfect graphs
• Partitioning a graph into disjoint cliques and a triangle-free graph
• On the structure of bull-free perfect graphs. II: The weakly chordal case
• The (theta, wheel)-free graphs. II: Structure theorem
• On graphs with 2 trivial distance ideals
• Perfect graphs with no balanced skew-partition are 2-clique-colorable
• The complexity of partitioning into disjoint cliques and a triangle-free graph
• Colouring vertices of triangle-free graphs without forests
• A polynomial Turing-kernel for weighted independent set in bull-free graphs
• Contracting to a longest path in H-free graphs
• Clique-stable set separation in perfect graphs with no balanced skew-partitions
• Partitioning \(H\)-free graphs of bounded diameter
• Graphs without five-vertex path and four-vertex cycle

This page was built for publication: The structure of bull-free graphs II and III -- a summary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765203)