An algorithm for the dominator chromatic number of a tree

Houcine Boumediene Merouane () and Mustapha Chellali
Additional contact information
Houcine Boumediene Merouane: University of Blida
Mustapha Chellali: University of Blida

Journal of Combinatorial Optimization, 2015, vol. 30, issue 1, No 3, 27-33

Abstract: Abstract A dominator coloring of a graph $$G$$ G is an assignment of colors to the vertices of $$G$$ G such that it is a proper coloring and every vertex dominates all the vertices of at least one color class. The minimum number of colors required for a dominator coloring of $$G$$ G is called the dominator chromatic number of $$G$$ G . In this paper, we give a polynomial time algorithm computing the dominator chromatic number for every nontrivial tree.

Keywords: Dominator coloring; Dominating set; Packing set; Trees; 05C15; 05C69 (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9631-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:1:d:10.1007_s10878-013-9631-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9631-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().