Total coloring of (sub)cubic Halin graphs

František Kardoš, Matúš Matok

Total coloring of a graph is a coloring of its vertices and edges such that adjacent or incident elements receive distinct colors. Total coloring conjecture (stipulating that the t…