Every planar graph with Δ {\rm{\Delta }} ⩾ 8 is totally (Δ+2) ({\rm{\Delta }}+2)‐choosable

From MaRDI portal
Publication:6047966



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.












This page was built for publication: Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047966)