List-Coloring Claw-Free Graphs with $\Delta-1$ Colors
From MaRDI portal
Publication:5346550
DOI10.1137/15M1051774zbMath1362.05046arXiv1508.03574OpenAlexW2962761326MaRDI QIDQ5346550
Daniel W. Cranston, Landon Rabern
Publication date: 24 May 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.03574
kernel methodclaw-free graphlist coloringAlon-Tarsi theoremBorodin-Kostochka conjectureonline list-coloring
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Application of polynomial method to on-line list colouring of graphs
- A generalization of combinatorial Nullstellensatz
- On two generalizations of the Alon-Tarsi polynomial method
- Brooks' theorem via the Alon-Tarsi theorem
- Chip games and paintability
- Claw-free graphs. IV: Decomposition theorem
- The average degree of a multigraph critical with respect to edge or total choosability
- Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
- Colorings and orientations of graphs
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- A strengthening of Brooks' theorem
- List edge and list total colourings of multigraphs
- On kernel-perfect orientations of line graphs
- The list chromatic index of a bipartite multigraph
- The polynomial method and restricted sums of congruence classes
- Mr. Paint and Mrs. Correct
- Painting squares in \(\Delta^2-1\) shades
- Graphs with $\chi=\Delta$ Have Big Cliques
- Bounding χ in terms of ω and Δ for quasi-line graphs
- Combinatorial Nullstellensatz
- Coloring Claw-Free Graphs with $\Delta-1$ Colors
