Brooks' theorem on powers of graphs
Abstract
We prove that for k≥ 3, the bound given by Brooks' theorem on the chromatic number of k-th powers of graphs of maximum degree ≥ 3 can be lowered by 1, even in the case of online list coloring.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.