On total coloring of some classes of regular graphs

DOI10.11650/tjm/220105zbMath1500.05021arXiv1910.03922OpenAlexW4213433270MaRDI QIDQ2167796

Kanagasabapathi Somasundaram, Shantharam Prajnanaswaroopa, J. Geetha, Hung-Lin Fu, Narayanan Narayanan

Publication date: 31 August 2022

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.03922

zbMATH Keywords

Cayley graphsregular graphsindependent setstotal coloringodd graphsmock threshold graphspower of cycles

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Total colorings-a survey

Cites Work

• Unnamed Item
• Coloring Hanoi and Sierpiński graphs
• A total-chromatic number analogue of Plantholt's theorem
• A result on the total colouring of powers of cycles
• Determining the total colouring number is NP-hard
• On 1-factorizability of Cayley graphs
• More odd graph theory
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Mock threshold graphs
• Total colourings of graphs
• Some properties of unitary Cayley graphs
• On the total coloring of planar graphs.
• Coloração Total do C²n

This page was built for publication: On total coloring of some classes of regular graphs