pith. sign in

arxiv: 1303.5136 · v3 · pith:3R556BXGnew · submitted 2013-03-21 · 🧮 math.CO

Sufficient sparseness conditions for G² to be (Delta+1)-choosable, when Deltage5

classification 🧮 math.CO
keywords deltachilchromaticconditionsdegreefraclistmaximum
0
0 comments X
read the original abstract

We determine the list chromatic number of the square of a graph $\chil(G^2)$ in terms of its maximum degree $\Delta$ when its maximum average degree, denoted $\mad(G)$, is sufficiently small. For $\Delta\ge 6$, if $\mad(G)<2+\frac{4\Delta-8}{5\Delta+2}$, then $\chil(G^2)=\Delta+1$. In particular, if $G$ is planar with girth $g\ge 7+\frac{12}{\Delta-2}$, then $\chil(G^2)=\Delta+1$. Under the same conditions, $\chil^i(G)=\Delta$, where $\chil^i$ is the list injective chromatic number.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)

    math.CO 2022-10 unverdicted

    This is a survey compiling results on strong edge-coloring and related coloring problems for squares of graphs in planar and sparse classes.