Claw-free graphs. V. Global structure
From MaRDI portal
Publication:958695
DOI10.1016/j.jctb.2008.03.002zbMath1196.05043OpenAlexW1965412489MaRDI QIDQ958695
Maria Chudnovsky, P. D. Seymour
Publication date: 8 December 2008
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.2008.03.002
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)
Related Items (51)
Clique-stable set separation in perfect graphs with no balanced skew-partitions ⋮ Enumeration of Maximal Irredundant Sets for Claw-Free Graphs ⋮ Enumeration of maximal irredundant sets for claw-free graphs ⋮ A note on the shameful conjecture ⋮ Polynomial kernelization for removing induced claws and diamonds ⋮ Claw-free strictly Deza graphs ⋮ Claw-free graphs. VI: Colouring ⋮ Semipaired domination in claw-free cubic graphs ⋮ On box-perfect graphs ⋮ Claw-free graphs. VII. Quasi-line graphs ⋮ The signature of two generalizations of line 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 ⋮ Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs ⋮ Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures ⋮ The stable set polytope of icosahedral graphs ⋮ Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree ⋮ A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) ⋮ Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs ⋮ Dominating set is fixed parameter tractable in claw-free graphs ⋮ 2-clique-bond of stable set polyhedra ⋮ Dominating induced matchings in graphs without a skew star ⋮ Semitotal domination in claw-free cubic graphs ⋮ A characterization of claw-free \(b\)-perfect graphs ⋮ Parameterized complexity of induced graph matching on claw-free graphs ⋮ A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free ⋮ An approximate version of Hadwiger's conjecture for claw-free graphs ⋮ Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey ⋮ Domination When the Stars Are Out ⋮ Double-critical graph conjecture for claw-free graphs ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ The Structure of Claw‐Free Perfect Graphs ⋮ On a conjecture on total domination in claw-free cubic graphs ⋮ Induced Disjoint Paths in Claw-Free Graphs ⋮ Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable ⋮ Separation routine and extended formulations for the stable set problem in claw-free graphs ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect ⋮ Graphs without large apples and the maximum weight independent set problem ⋮ Stable sets and graphs with no even holes ⋮ Zero forcing in claw-free cubic graphs ⋮ Polynomial Kernelization for Removing Induced Claws and Diamonds ⋮ Erdős-Lovász Tihany conjecture for graphs with forbidden holes ⋮ Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ ⋮ Clique minors in claw-free graphs ⋮ The structure of bull-free graphs I -- three-edge-paths with centers and anticenters ⋮ Incompressibility of \(H\)-free edge modification problems: towards a dichotomy ⋮ Domination versus total domination in claw-free cubic graphs ⋮ Upper total domination in claw-free cubic graphs ⋮ Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition ⋮ Triangles and (total) domination in subcubic graphs
Cites Work
This page was built for publication: Claw-free graphs. V. Global structure
