- Tytuł:
- Distance coloring of the hexagonal lattice
- Autorzy:
-
Jacko, Peter
Jendrol', Stanislav - Powiązania:
- https://bibliotekanauki.pl/articles/744329.pdf
- Data publikacji:
- 2005
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
distance coloring
distant chromatic number
hexagonal lattice of the plane
hexagonal tiling
hexagonal grid
radio channel frequency assignment - Opis:
- Motivated by the frequency assignment problem we study the d-distant coloring of the vertices of an infinite plane hexagonal lattice H. Let d be a positive integer. A d-distant coloring of the lattice H is a coloring of the vertices of H such that each pair of vertices distance at most d apart have different colors. The d-distant chromatic number of H, denoted $χ_d(H)$, is the minimum number of colors needed for a d-distant coloring of H. We give the exact value of $χ_d(H)$ for any d odd and estimations for any d even.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2005, 25, 1-2; 151-166
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł