Total Dominator Colorings of P 4 -reducible and P 4 -tidy Graphs
Wei Ge,
Jun Yue
Abstract:A total dominator coloring of G without isolated vertex is a proper coloring of the vertices of G in which each vertex of G is adjacent to every vertex of some color class. The total dominator chromatic number χ t d ( G ) of G is the minimum number of colors among all total dominator coloring of G . In this paper, we will give the polynomial time algorithms to computing the total dominator coloring number for P 4 -reducible and P 4 -tidy graphs.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.