On Coloring Problems of Snark Families

DOI10.1016/j.endm.2011.05.009zbMath1268.05085OpenAlexW2051470636MaRDI QIDQ2840681

Simone Dantas, Diana Sasaki, Celina M. Herrera de Figueiredo

Publication date: 23 July 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.009

zbMATH Keywords

graph coloringNP-completenesssnarkvertex coloringtotal chromatic numbertotal coloringdot productBlanusa familiescubic bridgeless graphsLoupekhine familysnark recognition problem

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

On type 2 snarks and dot products ⋮ Berge-Fulkerson conjecture on certain snarks

Cites Work

• The total-chromatic number of some families of snarks
• Snarks of order 18
• Special classes of snarks
• On the total coloring of certain graphs
• The NP-Completeness of Edge-Coloring
• The Colour Numbers of Complete Graphs
• Unnamed Item

This page was built for publication: On Coloring Problems of Snark Families