Total dominator chromatic number of a graph
From MaRDI portal
Publication:5134334
DOI10.22108/toc.2015.6171zbMath1463.05172arXiv1307.7486OpenAlexW1566478048MaRDI QIDQ5134334
Publication date: 16 November 2020
Full work available at URL: https://arxiv.org/abs/1307.7486
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (12)
Eccentricity splitting graph of a graph ⋮ Domination and dominator colorings in planar graphs with small diameter ⋮ Total dominator chromatic number of k-subdivision of graphs ⋮ Dominator and total dominator coloring of circulant graph Cn(1, 2) ⋮ On the dominated chromatic number of certain graphs ⋮ Compelling colorings: a generalization of the dominator chromatic number ⋮ Total dominator chromatic number of Kneser graphs ⋮ Total dominator coloring number of middle graphs ⋮ Complexity of total dominator coloring in graphs ⋮ Unnamed Item ⋮ Dominator and Total Dominator Colorings in Graphs ⋮ On strict strong coloring of graphs
Cites Work
This page was built for publication: Total dominator chromatic number of a graph