pith. sign in

arxiv: 0905.3475 · v2 · pith:DRCYOSMNnew · submitted 2009-05-21 · 🧮 math.CO

Algebraic proof of Brooks' theorem

Jan Hladk\'y , Daniel Kr\'al' , Uwe Schauz This is my paper
classification 🧮 math.CO
keywords brookstheoremalgebraiccoloringproofalonextensiongame
0
0 comments X
read the original abstract

We give a proof of Brooks' theorem and its list coloring extension using the algebraic method of Alon and Tarsi; this also shows that the Brooks' theorem remains valid in a more general game coloring setting.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)

    math.CO 2022-10 unverdicted

    This is a survey compiling results on strong edge-coloring and related coloring problems for squares of graphs in planar and sparse classes.