On dominator colorings in graphs

dc.contributor.author	Gera, Ralucca
dc.date.accessioned	2013-01-18T19:11:49Z
dc.date.available	2013-01-18T19:11:49Z
dc.date.issued	2007
dc.identifier.citation	Graph Theory Notes N. Y. / Volume 52, 25-30
dc.identifier.uri	https://hdl.handle.net/10945/25542
dc.description	The article of record as published may be located at http://gtn.kazlow.info/GTN54.pdf	en_US
dc.description	Graph Theory Notes of New York LII, (2007) 25-30	en_US
dc.description.abstract	Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in the graph dominates an entire 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 dominator chromatic number, chromatic number, and domination number.	en_US
dc.rights	This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.	en_US
dc.title	On dominator colorings in graphs	en_US
dc.type	Article	en_US
dc.contributor.department	Applied Mathematics

Related items