Abstract: Given a graph , the total dominator coloring problem seeks a proper coloring of 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 study this problem on several classes of graphs, as well as finding general bounds and characterizations. We also show the relation between total dominator chromatic number and chromatic number and total domination number.
Recommendations
Cites work
- Dominator colorings and safe clique partitions
- Dominator colorings in some classes of graphs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Total domination in graphs
Cited in
(24)- Total dominator chromatic number of some operations on a graph
- Compelling colorings: a generalization of the dominator chromatic number
- Split and non-split dominator chromatic numbers
- Dominator and total dominator colorings in graphs
- scientific article; zbMATH DE number 7295283 (Why is no real title available?)
- Dominator colorings and safe clique partitions
- On the dominated chromatic number of certain graphs
- On strict strong coloring of graphs
- Eccentricity splitting graph of a graph
- Total dominator chromatic number of k-subdivision of graphs
- Dominator and total dominator coloring of circulant graph Cn(1, 2)
- On the double total dominator chromatic number of graphs
- Total dominator chromatic number of Kneser graphs
- Total dominator coloring number of middle graphs
- Total dominator total coloring of a graph
- Complexity of total dominator coloring in graphs
- Dominator sum coloring algorithm for comb-double comb graph
- Coloring of graphs associated with commutative rings
- Dissimilarity between dominator and total dominator coloring of certain graphs
- An extensive study on the k-tuple total dominator chromatic number of graphs
- k-tuple total dominator chromatic number and Mycielskian graphs
- Majority dominator colorings of graphs
- Total dominator total chromatic numbers of some graphs
- Domination and dominator colorings in planar graphs with small diameter
This page was built for publication: Total dominator chromatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5134334)
