| Autor: |
Loe Jennifer, Middelbrooks Danielle, Morris Ashley, Wash Kirsti |
| Jazyk: |
angličtina |
| Rok vydání: |
2015 |
| Předmět: |
|
| Zdroj: |
Discussiones Mathematicae Graph Theory, Vol 35, Iss 1, Pp 55-72 (2015) |
| Druh dokumentu: |
article |
| ISSN: |
2083-5892 |
| DOI: |
10.7151/dmgt.1773 |
| Popis: |
A variation of graph coloring known as a t-tone k-coloring assigns a set of t colors to each vertex of a graph from the set {1, . . . , k}, where the sets of colors assigned to any two vertices distance d apart share fewer than d colors in common. The minimum integer k such that a graph G has a t- tone k-coloring is known as the t-tone chromatic number. We study the 2-tone chromatic number in three different graph products. In particular, given graphs G and H, we bound the 2-tone chromatic number for the direct product G×H, the Cartesian product G□H, and the strong product G⊠H. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
