Claw-free graphs. V. Global structure

DOI10.1016/J.JCTB.2008.03.002MaRDI QIDQ958695zbMATH OpenOpenAlexFDO

Authors Maria Chudnovsky, Paul 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

zbMATH Keywords

induced subgraphline graphsclaw-free graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Claw-free graphs. IV: Decomposition theorem
• The structure of claw-free graphs
• On graphs G for which both G and G are claw-free
• The structure of claw-free perfect graphs
• Claw-free graphs. III: Circular interval graphs

Cites work

• Claw-free graphs. I: Orientable prismatic graphs
• Claw-free graphs. II: Non-orientable prismatic graphs
• Claw-free graphs. III: Circular interval graphs
• Claw-free graphs. IV: Decomposition theorem

Cited in

(65)

• Solving the weighted stable set problem in claw-free graphs via decomposition
• The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
• Clique-stable set separation in perfect graphs with no balanced skew-partitions
• On {claw, antenna, net}-free graphs
• A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
• 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
• Separation routine and extended formulations for the stable set problem in claw-free graphs
• Claw-free graphs. I: Orientable prismatic graphs
• 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
• Lovász-Schrijver PSD-operator and the stable set polytope of claw-free 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)
• A characterization of claw-free \(b\)-perfect graphs
• On a conjecture on total domination in claw-free cubic graphs
• Claw-free graphs. III: Circular interval graphs
• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
• Clawfreeness of the powers of a graph
• Enumeration of maximal irredundant sets for claw-free graphs
• A note on the shameful conjecture
• Claw-free graphs. VI: Colouring
• Finding a smallest odd hole in a claw-free graph using global structure
• Blocks in graphs of a class of claw-free and 3-colorable graphs
• Claw-free strictly Deza graphs
• Enumeration of maximal irredundant sets for claw-free graphs
• scientific article; zbMATH DE number 7274067 (Why is no real title available?)
• The structure of claw-free perfect graphs
• Claw-free graphs that can be stretched on some 3-coclique and have non-clique \(\mu\)-subgraphs
• Claw-free graphs. VII. Quasi-line graphs
• Zero forcing in claw-free cubic graphs
• On box-perfect graphs
• Dominating induced matchings in graphs without a skew star
• The structure of claw-free graphs
• scientific article; zbMATH DE number 5844212 (Why is no real title available?)
• Stable sets and graphs with no even holes
• Paw-free graphs
• 2-clique-bond of stable set polyhedra
• The structure of claw-free binary matroids
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• The stable set polytope of icosahedral graphs
• Semitotal domination in claw-free cubic graphs
• Induced disjoint paths in claw-free graphs
• Perfect graphs with no balanced skew-partition are 2-clique-colorable
• The signature of two generalizations of line graphs
• An approximate version of Hadwiger's conjecture for claw-free graphs
• Erdős-Lovász Tihany conjecture for graphs with forbidden holes
• On graphs G for which both G and G are claw-free
• Parameterized complexity of induced graph matching on claw-free graphs
• Dominating set is fixed parameter tractable in claw-free graphs
• Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
• Clique minors in claw-free graphs
• Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
• Polynomial kernelization for removing induced claws and diamonds
• Claw-free graphs, skeletal graphs, and a stronger conjecture on \(\omega\), \(\Delta\), and \(\chi\)
• Claw-free graphs. IV: Decomposition theorem
• Domination versus total domination in claw-free cubic graphs
• Upper total domination in claw-free cubic graphs
• On the structure of graphs without claw, \(4K_1\) and co-R
• Total forcing and zero forcing in claw-free cubic graphs
• Polynomial kernelization for removing induced claws and diamonds
• Triangles and (total) domination in subcubic graphs
• Semipaired domination in claw-free cubic graphs
• On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
• Double-critical graph conjecture for claw-free graphs

This page was built for publication: Claw-free graphs. V. Global structure

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