The total-chromatic number of some families of snarks

DOI10.1016/j.disc.2011.02.013zbMath1222.05049OpenAlexW2042779161MaRDI QIDQ536223

C. N. Campos, Simone Dantas, Célia Picinin de Mello

Publication date: 16 May 2011

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.02.013

zbMATH Keywords

edge-colouringgraph colouringsnarktotal-colouring

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

On the total coloring of generalized Petersen graphs ⋮ On the equitable total chromatic number of cubic graphs ⋮ On total coloring and equitable total coloring of infinite snark families ⋮ Total colorings-a survey ⋮ The hunting of a snark with total chromatic number 5 ⋮ On Coloring Problems of Snark Families ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs

Cites Work

• Unnamed Item
• Determining the total colouring number is NP-hard
• Construction of class two graphs with maximum vertex degree three
• Total colouring regular bipartite graphs is NP-hard
• Special classes of snarks
• The circular chromatic index of Goldberg snarks
• On the total coloring of certain graphs
• On Total Chromatic Number of a Graph

This page was built for publication: The total-chromatic number of some families of snarks