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

DOI10.1016/j.jctb.2011.07.002zbMath1237.05138OpenAlexW2077416162MaRDI QIDQ765203

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 subgraphbull-free graphsgraph structure

Mathematics Subject Classification ID

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

Related Items

Clique-stable set separation in perfect graphs with no balanced skew-partitions ⋮ The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs ⋮ Partitioning \(H\)-free graphs of bounded diameter ⋮ The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs ⋮ The (theta, wheel)-free graphs. II: Structure theorem ⋮ On graphs with 2 trivial distance ideals ⋮ Improved FPT algorithms for weighted independent set in bull-free graphs ⋮ Finding matching cuts in \(H\)-free graphs ⋮ Clique‐width: Harnessing the power of atoms ⋮ Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs ⋮ Graphs of Separability at Most Two: Structural Characterizations and Their Consequences ⋮ Total domination edge critical graphs with total domination number three and many dominating pairs ⋮ Maximum weight independent sets in odd-hole-free graphs without dart or without bull ⋮ Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey ⋮ The complexity of partitioning into disjoint cliques and a triangle-free graph ⋮ Contracting to a longest path in H-free graphs ⋮ A polynomial Turing-kernel for weighted independent set in bull-free graphs ⋮ Graphs without five-vertex path and four-vertex cycle ⋮ Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable ⋮ Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs ⋮ Colouring vertices of triangle-free graphs without forests ⋮ The structure of bull-free graphs I -- three-edge-paths with centers and anticenters ⋮ The Structure of Bull-Free Perfect Graphs ⋮ Partitioning a graph into disjoint cliques and a triangle-free graph

Cites Work

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