Some conclusions of equitable total coloring of graph
From MaRDI portal
Recommendations
Cited in
(23)- Equitable total coloring of C_m C_n
- Equitable total coloring of graphs with maximum degree 3
- Equitable total-coloring of subcubic graphs
- On equitable coloring of central graphs and total graphs
- Equitable total chromatic numbers of the square graphs of some graphs
- On the equitable total coloring of some join-graphs
- On equitable total-coloring of W_m S_n
- On the equitable total coloring of double graph of some graphs
- On the equitable total chromatic number of \(P_n\vee K_{m,n}\)
- Equitable total coloring of some join graphs
- scientific article; zbMATH DE number 1556203 (Why is no real title available?)
- An algorithmic approach to equitable total chromatic number of graphs
- scientific article; zbMATH DE number 840689 (Why is no real title available?)
- scientific article; zbMATH DE number 7316523 (Why is no real title available?)
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- Recent progress on equitable coloring of graphs
- On equitable chromatic number of tadpole graph \(t_{m,n}\)
- scientific article; zbMATH DE number 7274154 (Why is no real title available?)
- Equitable coloring on total graph of bigraphs and central graph of cycles and paths
- On the equitable total coloring of multiple join-graph
- scientific article; zbMATH DE number 7714105 (Why is no real title available?)
- 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: Some conclusions of equitable total coloring of graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3609400)
