Abstract:A 2-distance k-coloring of a graph is a proper k-coloring of the vertices where vertices at distance at most 2 cannot share the same color. We prove the existence of a 2-distance (∆ + 2)-coloring for graphs with maximum average degree less than 8 3 (resp. 14 5 ) and maximum degree ∆ ≥ 6 (resp. ∆ ≥ 10). As a corollary, every planar graph with girth at least 8 (resp. 7) and maximum degree ∆ ≥ 6 (resp. ∆ ≥ 10) admits a 2-distance (∆ + 2)-coloring.
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.