Equitable total chromatic number of splitting graph

DOI10.22199/issn.0717-6279-2019-04-0045zbMath1451.05082OpenAlexW2981881332MaRDI QIDQ5142098

D. Muthuramakrishnan, K. Manikandan, Girija Jayaraman

Publication date: 29 December 2020

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22199/issn.0717-6279-2019-04-0045

zbMATH Keywords

splitting graphequitable total chromatic numberequitable total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Equitable total coloring of \(C_m\square C_n\)
• Equitable total coloring of graphs with maximum degree 3
• The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\)
• An Algorithmic Approach to Equitable Total Chromatic Number of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equitable total chromatic number of splitting graph