Total chromatic number of some families of graphs with maximum degree 3

Diana Sasaki (1) , Simone Dantas , Celina M. H. de Figueiredo , Myriam Preissmann (2)

1 COPPE-UFRJ - Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia
2 G-SCOP_OC - Optimisation Combinatoire

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.

Mots clés: snarks; edge-coloring; cubic graphs; total coloring

Domaines: Mathématique discrète [cs.DM]

Diana Sasaki, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann. Total chromatic number of some families of graphs with maximum degree 3. Matemática Contemporânea, 2014, 5th Latin-American Workshop on Cliques in Graphs, pp.42. ⟨hal-01084525⟩