Determining equitable total chromatic number for infinite classes of complete r-partite graphs
From MaRDI portal
Publication:2663994
Recommendations
Cites work
- Cycle decompositions of K_n and K_n-I
- Determining the total colouring number is NP-hard
- Equitable total coloring of C_m C_n
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- Equitable total coloring of graphs with maximum degree 3
- Equitable total-coloring of subcubic graphs
- scientific article; zbMATH DE number 840689 (Why is no real title available?)
- Nombre Chromatique Total Du Graphe R -Parti Complet
- On the equitable total chromatic number of cubic graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The Colour Numbers of Complete Graphs
- The number of transversals in a Latin square
Cited in
(8)- Equitable chromatic number of complete multipartite graphs
- Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- scientific article; zbMATH DE number 1416070 (Why is no real title available?)
- Total colorings-a survey
- On equitable total coloring of complete \(r\)-partite graphs
- Equitable total chromatic number of infinite classes of complete tripartite non balanced graphs
- Equitable total coloring of Fibonacci graphs
This page was built for publication: Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2663994)