On the equitable total chromatic number of cubic graphs

DOI10.1016/J.DAM.2015.10.013zbMATH Open1339.05125OpenAlexW2193341409MaRDI QIDQ298960FDOQ298960

Authors: Simone Dantas, Celina M. H. de Figueiredo, G. Mazzuoccolo, Myriam Preissmann, Vinícius F. dos Santos, Diana Sasaki 

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

Recommendations

• Equitable total coloring of corona of cubic graphs
• Equitable total-coloring of subcubic graphs
• Equitable total coloring of graphs with maximum degree 3
• Equitable total coloring of complete $r$-partite $p$-balanced graphs
• Total chromatic number of some families of graphs with maximum degree 3

zbMATH Keywords

NP-completenesscubic graphsequitable total-coloring

Mathematics Subject Classification ID

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

Cites Work

• 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
• Title not available (Why is that?)
• The total-chromatic number of some families of snarks
• Title not available (Why is that?)
• On Total Chromatic Number of a Graph
• 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
• Equitable colorings of line graphs and complete \(r\)-partite graphs
• NP completeness of finding the chromatic index of regular graphs
• Title not available (Why is that?)
• The Colour Numbers of Complete Graphs

Cited In (13)

• Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
• On total coloring and equitable total coloring of infinite snark families
• Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
• Total colorings-a survey
• Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even
• Equitable total coloring of complete $r$-partite $p$-balanced graphs
• Equitable total coloring of corona of cubic graphs
• Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
• Total coloring and total matching: polyhedra and facets
• Equitable total-coloring of subcubic graphs
• Kempe equivalence of colourings of cubic graphs
• Equitable total chromatic number of splitting graph
• On the equitable total coloring of Loupekine snarks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298960)