Answers are grounded in this paper and cite their sources.
A k-irregular graph is a graph with maximum degree k such that vertices of degree k are not adjacent. A $2$-distance k-coloring of a graph is a coloring of the vertices using k colors in which any two vertices at distance at most $2$ receive distinct colors. The $2$-distance chromatic number of G, denoted by χ₂(G), is the minimum integer k such that G admits a $2$-distance k-coloring. Zhu {zhu} proved that χ₂(G)≤ 13 for planar graphs with maximum degree at most $4$. We prove that for a 4-irregular planar graph G, we have χ₂(G) ≤ 10.
No takes yet. Share an insight, caveat, or question.
Sara Al Hajjar (2026) studied this question.