Emergent Mind
Every planar graph with $Δ\geqslant 8$ is totally $(Δ+2)$-choosable
(1904.12060)
Published Apr 26, 2019
in
cs.DM
and
math.CO
Abstract
Total coloring is a variant of edge coloring where both vertices and edges are to be colored. A graph is totally $k$-choosable if for any list assignment of $k$ colors to each vertex and each edge, we can extract a proper total coloring. In this setting, a graph of maximum degree $\Delta$ needs at least $\Delta+1$ colors. In the planar case, Borodin proved in 1989 that $\Delta+2$ colors suffice when $\Delta$ is at least 9. We show that this bound also holds when $\Delta$ is $8$.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.