Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
Discrete Applied Mathematics
On the complexity of planar covering of small graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Computing square roots of trivially perfect and threshold graphs
Discrete Applied Mathematics
Sufficient sparseness conditions for G2 to be (Δ+1)-choosable, when Δ≥5
Discrete Applied Mathematics
| Hi-index | 0.00 |
The problem of coloring the square of a graph naturally arises in connection with the distance labelings, which have been studied intensively. We consider this problem for sparse subcubic graphs. We show that the choosability $\chi_\ell(G^2)$ of the square of a subcubic graph $G$ of maximum average degree $d$ is at most four if $d