Claw-free graphs. VI: Colouring

DOI10.1016/J.JCTB.2010.04.005zbMath1207.05050OpenAlexW1998081086MaRDI QIDQ602712

Maria Chudnovsky, P. D. Seymour

Publication date: 5 November 2010

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.2010.04.005

zbMATH Keywords

coloringchoosabilityclaw-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (26)

Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 ⋮ Square-free graphs with no induced fork ⋮ Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs ⋮ On the chromatic number of \(2 K_2\)-free graphs ⋮ Local Clique Covering of Claw-Free Graphs ⋮ Coloring graph classes with no induced fork via perfect divisibility ⋮ Coloring of some crown-free graphs ⋮ Colouring squares of claw-free graphs ⋮ Independent sets and matchings in subcubic graphs ⋮ Dominating set is fixed parameter tractable in claw-free graphs ⋮ Colouring Squares of Claw-free Graphs ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Parameterized complexity of induced graph matching on claw-free graphs ⋮ On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs ⋮ Mycielski type constructions for hypergraphs associated with fractional colorings ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ List-coloring claw-free graphs with small clique number ⋮ Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs ⋮ Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ ⋮ Square-Free Graphs with No Six-Vertex Induced Path ⋮ 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 ⋮ Squared Chromatic Number Without Claws or Large Cliques ⋮ Locating-dominating sets: from graphs to oriented graphs ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Claw-free graphs. III: Circular interval graphs
• Claw-free graphs. V. Global structure
• The Ramsey number R(3, t) has order of magnitude t²/log t

This page was built for publication: Claw-free graphs. VI: Colouring