2-Distance Coloring of Planar Graphs

• 2-distance coloring of planar graphs is a vertex assignment ensuring distinct colors for vertices within two hops, equivalent to properly coloring the square of the graph.
• Recent research employs discharging methods and combinatorial arguments to tighten chromatic bounds under conditions like high girth, bounded degree, and sparsity.
• Developed techniques such as list coloring and recoloring support practical applications in frequency assignment and network scheduling.

A 2-distance coloring of a planar graph is an assignment of colors to the vertices such that every pair of vertices either adjacent or having a common neighbor receive distinct colors; equivalently, it is a proper coloring of the square of the graph, $G^2$, where vertices at distance at most two in $G$ become adjacent in $G^2$. The study of 2-distance coloring examines the minimum number of colors necessary, often focusing on additional constraints such as list colorability, bounds on maximum degree $\Delta$, bounds on maximum average degree $\operatorname{mad}(G)$, and girth conditions (the length of the shortest cycle). A central theme in the area is determining quantitative bounds for the 2-distance chromatic number on various classes of planar graphs and understanding the combinatorial structure that enables optimal or near-optimal colorings.

1. Fundamental Definitions and Equivalences

Let $G = (V,E)$ be a planar graph. A 2-distance $k$-coloring is a vertex coloring $f : V \to \{1,\ldots,k\}$ such that $f(u) \ne f(v)$ whenever $u$ and $G$0 are at distance at most $G$1 in $G$2.

• Square of a Graph: $G$3 is defined on $G$4 so that $G$5 if and only if $G$6.
• List Coloring: Each vertex $G$7 is assigned a list $G$8 of allowed colors and a coloring is valid if each vertex receives a color from its list and the 2-distance condition is satisfied.

The minimal number $G$9 for which $G^2$0 is (list-)colorable is called the (list) 2-distance chromatic number, denoted $G^2$1 or $G^2$2.

The natural lower bound is $G^2$3, as every vertex and its $G^2$4 neighbors must all receive distinct colors. The study aims to establish whether $G^2$5 colors suffice and to determine the minimum possible additive constant for broader classes of planar graphs.

2. Key Theorems and Historical Progress

Recent advances have improved upper bounds on $G^2$6, often under degree and sparsity constraints:

Paper/Authors	Conditions	Bound	arXiv id
Borodin & Ivanova (2009), Zhu & Bu	$G^2$7, girth $G^2$8	$G^2$9	-
(Bonamy et al., 2013)	$\Delta$0, $\Delta$1	List $\Delta$2	(Bonamy et al., 2013)
(Deniz, 2022)	$\Delta$3, girth $\Delta$4	$\Delta$5	(Deniz, 2022)
(La et al., 2021)	$\Delta$6, $\Delta$7	$\Delta$8	(La et al., 2021)
(La et al., 2021)	$\Delta$9, $\operatorname{mad}(G)$0	$\operatorname{mad}(G)$1	(La et al., 2021)
(Deniz, 2023, Aoki, 2023, Aoki, 2024)	Planar, $\operatorname{mad}(G)$2, $\operatorname{mad}(G)$3	$\operatorname{mad}(G)$4	(Deniz, 2023, Aoki, 2023, Aoki, 2024)
(Deniz, 2024, Bousquet et al., 2021)	Planar, arbitrary $\operatorname{mad}(G)$5	$\operatorname{mad}(G)$6	(Deniz, 2024)

These bounds have typically been achieved via intricate combinatorial arguments using minimal counterexamples, structural lemmas, and the discharging method.

3. Discharging Methodology and Structural Lemmas

The discharging method is central to almost all recent results. The process involves:

• Assigning "charge" to each vertex ($\operatorname{mad}(G)$7, with $\operatorname{mad}(G)$8 an appropriate constant) and face ($\operatorname{mad}(G)$9) based on the degree and face length.
• Global conservation of total charge (negative due to Euler's formula for planar graphs).
• Defining local transfer rules (discharging rules) based on degrees, face sizes, and configurations of vertices ("weak," "semiweak," "strong," "support," etc).
• Proving that after redistributing charge, every element has nonnegative final charge, contradicting the initial total.

For example, in (Bonamy et al., 2013), the initial weight is $G = (V,E)$0; the rules propagate fractions to control small degree vertices and forbidden local structures which are then shown to be reducible if present. The proof relies on a minimal counterexample approach, forbidding configurations (C₁–C₁₁), and finishing with a discharging argument that ensures $G = (V,E)$1, contradicting hypotheses for planar graphs of girth at least $G = (V,E)$2.

Additional techniques include recoloring arguments, using the potential method (as in (La et al., 2021)), or auxiliary constructions such as support vertex graphs.

4. Implications for Planar Graphs and Sparsity

The strongest results apply to planar graphs with high girth or bounded maximum average degree, which implies greater sparsity.

• Girth Constraints: Planar graphs with girth $G = (V,E)$3 satisfy $G = (V,E)$4 by Euler's formula. Girth $G = (V,E)$5 enforces $G = (V,E)$6, enabling sharper coloring bounds.
• Large Maximum Degree Regime: List 2-distance $G = (V,E)$7-colorability is proven for planar graphs of girth 6 with $G = (V,E)$8 (Bonamy et al., 2013) and further improvements are made for larger girth in more recent work.
• Smaller Degree and Girth Regimes: For planar graphs with $G = (V,E)$9, $k$0, bounds of $k$1 or better are achieved (Aoki, 2024). For $k$2, results refine to list 2-distance $k$3 (La et al., 2021).

These bounds approach optimality in light of lower bounds from vertex neighborhoods and known extremal constructions.

5. Connections to Other Coloring Variants

• Injective Coloring: Requires only that colors differ between vertices sharing a neighbor. The list injective $k$4-coloring bound is closely related to 2-distance coloring, often proven via similar methods (Bonamy et al., 2013).
• Exact Square Coloring: Distinct colors between vertices at distance exactly $k$5. For triangle-free graphs, this coincides with injective coloring (Foucaud et al., 2020).
• Strong Edge Coloring: Coloring edges so that edges at distance $k$6 differ; equivalent to coloring the square of the line graph, with strong results for cubic and high-girth planar graphs (Hudák et al., 2013).

6. Open Problems and Future Directions

Important directions posed in (Bonamy et al., 2013) and subsequent literature include:

• Determining the largest possible $k$7 for which there exists a graph with $k$8 not admitting a 2-distance $k$9-coloring. The paper shows $f : V \to \{1,\ldots,k\}$0 must be the limit if not tight.
• Lowering the minimum degree constraints, refining bounds for lower girth or different host surfaces.
• Extending proof techniques to additional coloring paradigms (list coloring, strong coloring) or broader graph classes.
• Development of automated discharging and LP-based frameworks, as pioneered in recent work, for pushing bounds further (Bousquet et al., 2022).

7. Practical Applications

2-distance coloring models interference constraints in frequency assignment problems, register allocation, and channel assignment in wireless networks. Improving bounds leads to more efficient allocations under the constraint that "nearby" elements must differ, directly influencing theoretical limits in such applications. In computer science, advances inform coloring and scheduling algorithms for sparse networks or systems modeled by planar graphs.

---

This topic remains an active area of graph coloring research, with recent progress moving toward linear or nearly optimal colorings for broader regimes of planar graphs, and with significant interplay between structural combinatorics and algorithmic techniques.