Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes. We initiate to study this problem on several classes of graphs, as well as finding general bounds and characterizations. We also compare the total dominator chromatic number of a graph with the chromatic number and the total domination number of it.
M. Chellali and F. Maffray (2012). Dominator Colorings in Some Classes of Graphs. Graphs Combin.. 28, 97-107 M. R. Garey and D. S. Johnson (1979). Computers and Intractability. A Series of Books in the Mathematical Sciences, W. H. Freeman and Co., San Francisco, Calif.. R. Gera (2007). On the dominator colorings
in bipartite graphs. Inform. Technol. NewGen.. ITNG07, 947-952 R. Gera (2007). On dominator colorings in graphs. Graph Theory Notes N. Y.. 52, 25-30 R. Gera, S. Horton and C. Rasmussen (2006). Dominator colorings and safe clique partitions, Proceedings of the Thirty-Seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer.. 181, 19-32 T. W. Haynes, S. T. Hedetniemi and P. J. Slater (1998). Fundamentals of Domination in Graphs. Monographs and Textbooks in Pure and Applied Mathematics, Marcel Dekker, Inc., New York. 208 T. W. Haynes, S. T. Hedetniemi and P. J. Slater (1998). Domination in Graphs: Advanced Topics. Monographs and Textbooks in Pure and Applied Mathematics, Marcel Dekker, Inc. New
York. 209 M. A. Henning and A. Yeo (2013). Total domination in graphs. Springer Monographs in Mathematics, Springer, New York. D. B. West (2001). Introduction to Graph Theorey. 2nd ed., Prentice Hall, USA.
)
