Grytczuk's conjecture on bounded nonrepetitive chromatic number of planar graphs
Let be a graph. A vertex coloring is nonrepetitive if no path has a color sequence of the form . Let denote the minimum number of colors in a nonrepetitive vertex coloring of . Grytczuk's conjecture. There is an absolute constant such that every planar graph satisfies
References
Status
- Solved: Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, and David R. Wood. Planar Graphs Have Bounded Nonrepetitive Chromatic Number (Advances in Combinatorics, 2020) https://arxiv.org/abs/1904.05269
Source: János Barát and Július Czap, “Vertex coloring of plane graphs with nonrepetitive boundary paths”, arXiv:1105.1023 (2011).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.