On the equitable total chromatic number of cubic graphs

DOI10.1016/j.dam.2015.10.013zbMath1339.05125OpenAlexW2193341409MaRDI QIDQ298960

Simone Dantas, Diana Sasaki, Vinícius Fernandes dos Santos, Celina M. Herrera de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann

Publication date: 21 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.10.013

zbMATH Keywords

NP-completenesscubic graphsequitable total-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even ⋮ Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs ⋮ Equitable total coloring of complete $r$-partite $p$-balanced graphs ⋮ Total coloring and total matching: polyhedra and facets ⋮ On total coloring and equitable total coloring of infinite snark families ⋮ Total colorings-a survey ⋮ Equitable total coloring of corona of cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The total-chromatic number of some families of snarks
• Determining the total colouring number is NP-hard
• Construction of class two graphs with maximum vertex degree three
• Equitable coloring and the maximum degree
• Equitable total coloring of graphs with maximum degree 3
• Equitable total-coloring of subcubic graphs
• A concise proof for total coloring subcubic graphs
• The hunting of a snark with total chromatic number 5
• On the total coloring of certain graphs
• NP completeness of finding the chromatic index of regular graphs
• The Colour Numbers of Complete Graphs
• On Total Chromatic Number of a Graph

This page was built for publication: On the equitable total chromatic number of cubic graphs