On the total coloring of generalized Petersen graphs

DOI10.1016/j.disc.2015.12.010zbMath1333.05105OpenAlexW2222132127MaRDI QIDQ271609

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

Publication date: 7 April 2016

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

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

zbMATH Keywords

cubic graphgeneralized Petersen graphtotal coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Coloring 3-power of 3-subdivision of subcubic graph ⋮ Strong edge chromatic index of the generalized Petersen graphs ⋮ Total colorings-a survey ⋮ Edge metric dimension of some generalized Petersen graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamilton paths in generalized Petersen graphs
• The total-chromatic number of some families of snarks
• Fractional total colourings of graphs of high girth
• Determining the total colouring number is NP-hard
• Vertex domination of generalized Petersen 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
• A generalization of Sylvester's and Frobenius' problems on numerical semigroups
• Decompositions and reductions of snarks
• A theorem on tait colorings with an application to the generalized Petersen graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• On Total Chromatic Number of a Graph

This page was built for publication: On the total coloring of generalized Petersen graphs