@article {IOPORT.05888522,
    author       = {Campos, C.N. and Dantas, S. and de Mello, C.P.},
    title        = {The total-chromatic number of some families of snarks.},
    year         = {2011},
    journal      = {Discrete Mathematics},
    volume       = {311},
    number       = {12},
    issn         = {0012-365X},
    pages        = {984-988},
    publisher    = {Elsevier Science B.V. (North-Holland), Amsterdam},
    doi          = {10.1016/j.disc.2011.02.013},
    abstract     = {Summary: The total-chromatic number $\chi_T(G)$ is the least number of colours needed to colour the vertices and edges of a graph $G$ such that no incident or adjacent elements (vertices or edges) receive the same colour. It is known that the problem of determining the total-chromatic number is NP-hard, and it remains NP-hard even for cubic bipartite graphs. Snarks are simple connected bridgeless cubic graphs that are not 3-edge-colourable. In this paper, we show that the total-chromatic number is 4 for three infinite families of snarks, namely, the Flower Snarks, the Goldberg Snarks, and the Twisted Goldberg Snarks. This result reinforces the conjecture that all snarks have total-chromatic number 4. Moreover, we give recursive procedures to construct a total-colouring that uses 4 colours in each case.},
    identifier   = {05888522},
}