Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even

DOI10.1016/j.entcs.2019.08.060OpenAlexW2978663790WikidataQ113317369 ScholiaQ113317369MaRDI QIDQ2132407

Diana Sasaki, Anderson G. da Silva, Simone Dantas

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.060

zbMATH Keywords

graph coloringequitable total coloringcomplete \(r\)-partite \(p\)-balanced graphs

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• On the equitable total chromatic number of cubic graphs
• The number of transversals in a Latin square
• Determining the total colouring number is NP-hard
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Equitable total coloring of graphs with maximum degree 3
• Equitable total-coloring of subcubic graphs
• Equitable total coloring of complete $r$-partite $p$-balanced graphs
• Nombre Chromatique Total Du Graphe R -Parti Complet
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Unnamed Item
• Unnamed Item

This page was built for publication: Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even