# DMGT

ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

# IMPACT FACTOR 2019: 0.755

SCImago Journal Rank (SJR) 2019: 0.600

Rejection Rate (2018-2019): c. 84%

# Discussiones Mathematicae Graph Theory

Article in press

Authors:

A. Brandt, S. Jahanbekam, J. White

Title:

Additive list coloring of planar graphs with given girth

Source:

Discussiones Mathematicae Graph Theory

Received: 2017-05-29, Revised: 2018-05-18, Accepted: 2018-05-18, https://doi.org/10.7151/dmgt.2156

Abstract:

An additive coloring of a graph $G$ is a labeling of the vertices of $G$ from $\{1,2,\ldots,k\}$ such that two adjacent vertices have distinct sums of labels on their neighbors. The least integer $k$ for which a graph $G$ has an additive coloring is called the additive coloring number of $G$, denoted $\luck(G)$. Additive coloring is also studied under the names lucky labeling and open distinguishing. In this paper, we improve the current bounds on the additive coloring number for particular classes of graphs by proving results for a list version of additive coloring. We apply the discharging method and the Combinatorial Nullstellensatz to show that every planar graph $G$ with girth at least $5$ has $\luck(G)\leq 19$, and for girth at least $6$, $7$, and $26$, $\luck(G)$ is at most 9, 8, and 3, respectively. In 2009, Czerwi$\acute{\mbox{n}}$ski, Grytczuk, and $\dot{\mbox{Z}}$elazny conjectured that $\luck(G) \leq \chi(G)$, where $\chi(G)$ is the chromatic number of $G$. Our result for the class of non-bipartite planar graphs of girth at least 26 is best possible and affirms the conjecture for this class of graphs.

Keywords:

lucky labeling, additive coloring, reducible configuration, discharging method, Combinatorial Nullstellensatz