Total colorings of circulant graphs

DOI10.1142/S1793830921500506zbMath1478.05053OpenAlexW3097365176MaRDI QIDQ5025120

J. Geetha, Hung-Lin Fu, Kanagasabapathi Somasundaram

Publication date: 1 February 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500506

zbMATH Keywords

total coloringpowers of cyclescomplement of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Results about the total chromatic number and the conformability of some families of circulant graphs ⋮ Total colorings-a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• A result on the total colouring of powers of cycles
• Determining the total colouring number is NP-hard
• Total and fractional total colourings of circulant graphs
• Total colouring regular bipartite graphs is NP-hard
• Total colourings of graphs
• Coloração Total do C²n

This page was built for publication: Total colorings of circulant graphs