A q-total coloring of a graph G is an assignment of q colors to the vertices and edges of G, so that adjacent or incident elements have different colors. The Total Coloring Conjecture (TCC) asserts that an optimum total coloring of G has at least ∆+1 and at most ∆+2 colors. We determine that all members of new infinite families of snarks obtained by the Kochol superposition of Goldberg with Blowup snarks are Type 1.
No takes yet. Share an insight, caveat, or question.
Penao et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: