On Dominator Colorings in Graphs

@inproceedings{Gera2008OnDC,
  title={On Dominator Colorings in Graphs},
  author={Ralucca Michelle Gera},
  year={2008}
}
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. 

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Domination in Graphs: Advanced Topics

  • T. W. Haynes, S. T. Hedetniemi, P. J. Slater
  • Marcel Dekker, New York
  • 1998
2 Excerpts

Dominating partitions of graphs

  • E. Cockayne, S. Hedetniemi
  • tech. rep.
  • 1979
1 Excerpt

Theory of Graphs

  • O. Ore
  • no. 38 in American Mathematical Society…
  • 1962
1 Excerpt

Theory of Graphs and its Applications

  • C. Berge
  • no. 2 in Collection Universitaire de…
  • 1958
1 Excerpt

Similar Papers

Loading similar papers…