Claw-free graphs. V. Global structure

DOI10.1016/j.jctb.2008.03.002zbMath1196.05043MaRDI QIDQ958695

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 subgraph; claw-free graphs; line graphs

Mathematics Subject Classification ID

05C38: Paths and cycles

05C75: Structural characterization of families of graphs

05C76: Graph operations (line graphs, products, etc.)

Related Items

Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ, Induced Disjoint Paths in Claw-Free Graphs, Enumeration of Maximal Irredundant Sets for Claw-Free Graphs, The Structure of Claw‐Free Perfect Graphs, Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition, Semitotal domination in claw-free cubic graphs, Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree, Clique-stable set separation in perfect graphs with no balanced skew-partitions, The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect, 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, Parameterized complexity of induced graph matching on claw-free graphs, Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey, Double-critical graph conjecture for claw-free graphs, Claw-free graphs. VI: Colouring, A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants), Dominating set is fixed parameter tractable in claw-free graphs, A characterization of claw-free \(b\)-perfect graphs, A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free, On a conjecture on total domination in claw-free cubic 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, Stable sets and graphs with no even holes, Clique minors in claw-free graphs, The structure of bull-free graphs I -- three-edge-paths with centers and anticenters, The stable set polytope of icosahedral graphs, Enumeration of maximal irredundant sets for claw-free graphs, A note on the shameful conjecture, On box-perfect graphs, Total forcing and zero forcing in claw-free cubic graphs, Claw-free graphs. VII. Quasi-line graphs, 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, 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, Triangles and (total) domination in subcubic graphs, Zero forcing in claw-free cubic graphs, Erdős-Lovász Tihany conjecture for graphs with forbidden holes, Polynomial kernelization for removing induced claws and diamonds, Claw-free strictly Deza graphs, Semipaired domination in claw-free cubic graphs, The signature of two generalizations of line graphs, 2-clique-bond of stable set polyhedra, Dominating induced matchings in graphs without a skew star, Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs, Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable, Polynomial Kernelization for Removing Induced Claws and Diamonds, Domination When the Stars Are Out, Asymptotics of the chromatic number for quasi-line graphs, An approximate version of Hadwiger's conjecture for claw-free graphs

Cites Work