On equitable total coloring of complete r-partite graphs

DOI10.21711/231766362017/RMC4516MaRDI QIDQ6489486FDO

Authors Anderson G. da Silva, Simone Dantas, Diana Sasaki

Publication date 22 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

zbMATH Keywords

algorithmcomplete \(r\)-partite graphequitable total coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorics on words (68R15)

Recommendations

• Equitable total coloring of complete $r$-partite $p$-balanced graphs
• Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
• Equitable total chromatic number of infinite classes of complete tripartite non balanced graphs
• Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even
• Equitable colorings of line graphs and complete \(r\)-partite graphs

Cited in

(2)

• Equitable total chromatic number of infinite classes of complete tripartite non balanced graphs
• Total colorings of complete multipartite graphs using amalgamations

This page was built for publication: On equitable total coloring of complete \(r\)-partite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489486)