Charpentier's coloring conjecture for squares of graphs with maximum average degree below 4
Let be a graph, let denote its maximum degree, let denote its maximum average degree, and let be its square, with chromatic number . Charpentier's conjecture. There exists an integer such that every graph with and has
References
Status
- Refuted: Seog-Jin Kim and Boram Park. Coloring the squares of graphs whose maximum average degrees are less than 4 (arXiv, 2015) https://arxiv.org/abs/1506.04401
Source: H. A. Kierstead, Daqing Yang and Junjun Yi, “On coloring numbers of graph powers”, arXiv:1907.10962 (2019).
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.