The hunting of a snark with total chromatic number 5
From MaRDI portal
Publication:2448882
DOI10.1016/j.dam.2013.04.006zbMath1288.05101OpenAlexW4302768836MaRDI QIDQ2448882
Myriam Preissmann, Simone Dantas, Diana Sasaki, Celina M. Herrera de Figueiredo
Publication date: 5 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.006
Related Items (8)
On the total coloring of generalized Petersen graphs ⋮ On the equitable total chromatic number of cubic graphs ⋮ The cost of perfection for matchings in graphs ⋮ On total coloring and equitable total coloring of infinite snark families ⋮ Total colorings-a survey ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Normal 5-edge-colorings of a family of Loupekhine snarks ⋮ Snarks from a Kászonyi perspective: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The total-chromatic number of some families of snarks
- A result on the total colouring of powers of cycles
- Determining the total colouring number is NP-hard
- Construction of class two graphs with maximum vertex degree three
- Note sur la non existence d'un snark d'ordre 16
- Snarks of order 18
- The total chromatic number of nearly complete bipartite graphs
- Total colouring regular bipartite graphs is NP-hard
- Special classes of snarks
- Total colourings of graphs
- On the total coloring of certain graphs
- C-Minimal Snarks
- The NP-Completeness of Edge-Coloring
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- NP completeness of finding the chromatic index of regular graphs
- The Colour Numbers of Complete Graphs
- Network-Colourings
This page was built for publication: The hunting of a snark with total chromatic number 5
