pith. sign in

arxiv: 1310.5493 · v1 · pith:H6GERHVCnew · submitted 2013-10-21 · 💻 cs.DM · math.CO

Brooks' theorem on powers of graphs

Marthe Bonamy , Nicolas Bousquet This is my paper
classification 💻 cs.DM math.CO
keywords brooksgraphspowerstheoremboundcasechromaticcoloring
0
0 comments X
read the original abstract

We prove that for $k\geq 3$, the bound given by Brooks' theorem on the chromatic number of $k$-th powers of graphs of maximum degree $\Delta \geq 3$ can be lowered by 1, even in the case of online list coloring.

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.