For a graph G, by χ 2 (G) we denote the minimum integer k, such that there is a k-coloring of the vertices of G in which vertices at distance at most 2 receive distinct colors. Equivalently, χ 2 (G) is the chromatic number of the square of G. In 1977 Wegner conjectured that if G is planar and has maximum degree ∆, then χ 2 (G) ≤ 7 if ∆ ≤ 3, χ 2 (G) ≤ ∆ + 5 if 4 ≤ ∆ ≤ 7, and 3∆/2 + 1 if ∆ ≥ 8. Despite extensive work, the known upper bounds are quite far from the conjectured ones, especially for small values of ∆. In this work we show that for every planar graph G with maximum degree ∆ it holds that χ 2 (G) ≤ 3∆ + 4. This result provides the best known upper bound for 6 ≤ ∆ ≤ 14.
For a graph G, by χ 2 (G) we denote the minimum integer k, such that there is a kcoloring of the vertices of G in which vertices at distance at most 2 receive distinct colors. Equivalently, χ 2 (G) is the chromatic number of the square of G. In 1977 Wegner conjectured that if G is planar and has maximum degree, and 3∆/2 + 1 if ∆ ≥ 8. Despite extensive work, the known upper bounds are quite far from the conjectured ones, especially for small values of ∆. In this work we show that for every planar graph G with maximum degree ∆ it holds that χ 2 (G) ≤ 3∆ + 4. This result provides the best known upper bound for 6 ≤ ∆ ≤ 14.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.