Some results on 2-distance coloring of planar graphs with girth five
Abstract
A vertex coloring of a graph G is called a 2-distance coloring if any two vertices at a distance at most 2 from each other receive different colors. Suppose that G is a planar graph with girth 5 and maximum degree . We prove that G admits a 2-distance +7 coloring, which improves the result of Dong and Lin (J. Comb. Optim. 32(2), 645-655, 2016). Moreover, we prove that G admits a 2-distance +6 coloring when ≥ 10.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.