Answers are grounded in this paper and cite their sources.
A $2$-distance k-coloring of a graph is a proper vertex k-coloring where vertices at distance at most 2 cannot share the same color. We prove the existence of a $2$-distance $4$-coloring for planar subcubic graphs with girth at least 21. We also show a construction of a planar subcubic graph of girth 11 that is not $2$-distance $4$-colorable. Comment: 21 pages, 14 figures
No takes yet. Share an insight, caveat, or question.
La et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: