Strong odd coloring of sparse graphs
| Autor: | Kwon, Hyemin, Park, Boram |
|---|---|
| Rok vydání: | 2024 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | An odd coloring of a graph $G$ is a proper coloring of $G$ such that for every non-isolated vertex $v$, there is a color appearing an odd number of times in $N_G(v)$. Odd coloring of graphs was studied intensively in recent few years. In this paper, we introduce the notion of a strong odd coloring, as not only a strengthened version of odd coloring, but also a relaxation of square coloring. A strong odd coloring of a graph $G$ is a proper coloring of $G$ such that for every non-isolated vertex $v$, if a color appears in $N_G(v)$, then it appears an odd number of times in $N_G(v)$. We denote by $\chi_{so}(G)$ the smallest integer $k$ such that $G$ admits a strong odd coloring with $k$ colors. We prove that if $G$ is a graph with $mad(G)\le\frac{20}{7}$, then $\chi_{so}(G)\le \Delta(G)+4$, and the bound is tight. We also prove that if $G$ is a graph with $mad(G)\le\frac{30}{11}$ and $\Delta(G)\ge 4$, then $\chi_{so}(G)\le \Delta(G)+3$. Comment: 21 pages, 12 figures |
| Databáze: | arXiv |
| Externí odkaz: |
|