Claw-free graphs. IV: Decomposition theorem

DOI10.1016/J.JCTB.2007.06.007MaRDI QIDQ947722zbMATH OpenOpenAlexFDO

Authors Maria Chudnovsky, Paul Seymour

Publication date 7 October 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.2007.06.007

zbMATH Keywords

decompositioninduced subgraphsclaw-free graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• The structure of claw-free graphs
• Triangulation and clique separator decomposition of claw-free graphs
• Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
• Claw-free graphs---a survey
• Claw-free graphs. V. Global structure
• Claw-decomposition of Kneser graphs
• Claw-free strictly Deza graphs
• scientific article; zbMATH DE number 7274067
• Almost claw‐free graphs
• Claw-free graphs with complete closure

Cites work

• Bull-free Berge graphs are perfect
• Claw-free graphs. I: Orientable prismatic graphs
• Claw-free graphs. II: Non-orientable prismatic graphs
• Claw-free graphs. III: Circular interval graphs
• The Factorization of Linear Graphs
• The strong perfect graph theorem

Cited in

(59)

• Solving the weighted stable set problem in claw-free graphs via decomposition
• Clique-coloring of \(K_{3,3}\)-minor free graphs
• The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
• On graphs with no induced subdivision of \(K_4\)
• The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
• On {claw, antenna, net}-free graphs
• A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
• Claw-free graphs. I: Orientable prismatic graphs
• List-coloring claw-free graphs with \(\Delta-1\) colors
• Graphs without large apples and the maximum weight independent set problem
• Claw-free graphs. II: Non-orientable prismatic graphs
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
• On a conjecture on total domination in claw-free cubic graphs
• Graphs of separability at most 2
• Claw-free graphs. III: Circular interval graphs
• Gear composition and the stable set polytope
• Claw-decomposition of Kneser graphs
• The stable set polytope of claw-free graphs with large stability number
• Claw-free graphs. V. Global structure
• Clawfreeness of the powers of a graph
• Clique-coloring claw-free graphs
• A note on the shameful conjecture
• Blocks in graphs of a class of claw-free and 3-colorable graphs
• Claw-free strictly Deza graphs
• A Polynomial Kernel for Line Graph Deletion
• The structure of claw-free perfect graphs
• Set graphs. V. on representing graphs as membership digraphs
• Growing without cloning
• scientific article; zbMATH DE number 7764101 (Why is no real title available?)
• Excluding the fork and antifork
• (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
• Claw-free graphs. VII. Quasi-line graphs
• The structure of claw-free graphs
• Graphs of separability at most two: structural characterizations and their consequences
• Paw-free graphs
• The structure of claw-free binary matroids
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• Declawing a graph: polyhedra and branch-and-cut algorithms
• Coloring graph classes with no induced fork via perfect divisibility
• Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
• Clique or hole in claw-free graphs
• Some results on the reconstruction problems. p‐claw‐free, chordal, and p₄‐reducible graphs
• On graphs G for which both G and G are claw-free
• Parameterized complexity of induced graph matching on claw-free graphs
• Trisimplicial vertices in (fork, odd parachute)-free graphs
• The equivalence number of a line graph
• Dominating set is fixed parameter tractable in claw-free graphs
• Decomposition of a Complete Multi-Partite Graph into Isomorphic Claws
• Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
• Induced subgraphs and tree decompositions. XIV: Non-adjacent neighbours in a hole
• Hereditary efficiently dominatable graphs
• On the Stable Set Polytope of Claw-Free Graphs
• Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
• Polynomial kernelization for removing induced claws and diamonds
• Kernel for proper Helly circular-arc vertex deletion: smaller and simpler via graph isomorphism
• On the structure of graphs without claw, \(4K_1\) and co-R
• Polynomial kernelization for removing induced claws and diamonds
• On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
• Vertex elimination orderings for hereditary graph classes

This page was built for publication: Claw-free graphs. IV: Decomposition theorem

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