2000 character limit reached
2-Distance Coloring of Planar Graphs with Maximum Degree at Least 6 (2509.10861v1)
Published 13 Sep 2025 in math.CO
Abstract: A k-distance r-coloring of a graph is a coloring of the vertices of the graph such that if the distance between 2 vertices x and y is less or equal to k, then x and y must have distinct colors. A planar graph is a graph that can be drawn with no edge crossing. We will study the 2-distance coloring of planar graphs with maximum degree at least 6.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
