The square $G^2$ of a graph $G$ is the graph defined on $V(G)$ such that two vertices $u$ and $v$ are adjacent in $G^2$ if the distance between $u$ and $v$ in $G$ is at most 2. The {\em maximum average degree} of $G$, $mad (G)$, is the maximum among the average degrees of the subgraphs of $G$.
It is known in \cite{BLP-14-JGT} that there is no constant $C$ such that every graph $G$ with $mad(G)< 4$ has $\chi(G^2) \leq \Delta(G) + C$. Charpentier \cite{Charpentier14} conjectured that there exists an integer $D$ such that every graph $G$ with $\Delta(G)\ge D$ and $mad(G)<4$ has $\chi(G^2) \leq 2 \Delta(G)$. Recent result in \cite{BLP-DM} implies that $\chi(G^2) \leq 2 \Delta(G)$ if $mad(G) < 4 -\frac{1}{c}$ with $\Delta(G) \geq 40c -16$.
In this paper, we show for $c\ge 2$, if $mad(G) < 4 - \frac{1}{c}$ and $\Delta(G) \geq 14c-7$, then $\chi_\ell(G^2) \leq 2 \Delta(G)$, which improves the result in \cite{BLP-DM}. We also show that for every integer $D$, there is a graph $G$ with $\Delta(G)\ge D$ such that $mad(G)<4$, and $\chi(G^2) \geq 2\Delta(G) +2$, which disproves Charpentier's conjecture. In addition, we give counterexamples to Charpentier's another conjecture in \cite{Charpentier14}, stating that for every integer $k\ge 3$, there is an integer $D_k$ such that every graph $G$ with $mad(G)<2k$ and $\Delta(G)\ge D_k$ has $\chi(G^2) \leq k\Delta(G) -k$.
[1]
Matthew P. Yancey.
Coloring the square of a sparse graph G with almost Δ(G) colors
,
2016,
Discret. Appl. Math..
[2]
Richard M. Wilson,et al.
A course in combinatorics
,
1992
.
[3]
Daniel Král,et al.
Coloring squares of planar graphs with girth six
,
2008,
Eur. J. Comb..
[4]
Marthe Bonamy,et al.
List coloring the square of sparse graphs with large degree
,
2013,
Eur. J. Comb..
[5]
Marthe Bonamy,et al.
Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable
,
2014,
Discret. Math..
[6]
Ko-Wei Lih,et al.
Labeling Planar Graphs with Conditions on Girth and Distance Two
,
2004,
SIAM J. Discret. Math..
[7]
A. O. Ivanova,et al.
2-distance ( ∆ + 2 )-coloring of planar graphs with girth six and ∆ ≥ 18
,
2009
.
[8]
G. Wegner.
Graphs with given diameter and a coloring problem
,
1977
.
[9]
Marthe Bonamy,et al.
2-Distance Coloring of Sparse Graphs
,
2014,
J. Graph Theory.
[10]
C. Charpentier.
2-distance coloring of not-so-sparse graphs
,
2014
.