Total dominator chromatic number of a graph
Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ 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 initiate to study this problem on several classes o...
Bewaard in:
| Hoofdauteur: | |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
University of Isfahan
2015-06-01
|
| Reeks: | Transactions on Combinatorics |
| Onderwerpen: | |
| Online toegang: | http://www.combinatorics.ir/pdf_6171_9ef54a03e9ce8be1ddbac6d68cda24c0.html |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|