Coloring Claw-Free Graphs with $\Delta-1$ Colors
From MaRDI portal
Publication:5300509
DOI10.1137/12088015XzbMath1268.05069arXiv1206.1269OpenAlexW4251751787MaRDI QIDQ5300509
Landon Rabern, Daniel W. Cranston
Publication date: 27 June 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.1269
Related Items (16)
Painting squares in \(\Delta^2-1\) shades ⋮ Brooks' Theorem and Beyond ⋮ List-Coloring Claw-Free Graphs with $\Delta-1$ Colors ⋮ Graphs with $\chi=\Delta$ Have Big Cliques ⋮ Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ A note on \(\Delta\)-critical graphs ⋮ Large cliques in graphs with high chromatic number ⋮ Special issue in honour of Landon Rabern ⋮ Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors ⋮ Strengthening Brooks' chromatic bound on \(P_6\)-free graphs ⋮ Borodin-Kostochka conjecture holds for odd-hole-free graphs ⋮ Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices ⋮ Chromatic-choosability of hypergraphs with high chromatic number ⋮ Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs ⋮ Coloring Graphs with Dense Neighborhoods
This page was built for publication: Coloring Claw-Free Graphs with $\Delta-1$ Colors
