- Tytuł:
- 2-Tone Colorings in Graph Products
- Autorzy:
-
Loe, Jennifer
Middelbrooks, Danielle
Morris, Ashley
Wash, Kirsti - Powiązania:
- https://bibliotekanauki.pl/articles/31339114.pdf
- Data publikacji:
- 2015-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
t-tone coloring
Cartesian product
direct product
strong product - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2015, 35, 1; 55-72
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł