Total chromatic number of some families of graphs with maximum degree 3
Résumé
The focus of this work is the total coloring of graphs with maximumdegree 3. We 4-total-color five infinite families with maximum degree 3:a new infinite family of snarks constructed from Blanusa snarks; twonew infinite families of cubic graphs constructed from 4-Möbius-ladderand 5-ladder, respectively; and two grid families, Hexagonal-grid andPentagonal-grid.