No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
Resource
Discrete Mathematics 307 (14): 1808-1817
Journal
Discrete Mathematics
Journal Volume
307
Journal Issue
14
Pages
1808-1817
Date Issued
2007
Author(s)
Abstract
A no-hole 2-distant coloring of a graph Γ is an assignment c of nonnegative integers to the vertices of Γ such that | c (v) - c (w) | ≥ 2 for any two adjacent vertices v and w, and the integers used are consecutive. Whenever such a coloring exists, define nsp (Γ) to be the minimum difference (over all c) between the largest and smallest integers used. In this paper we study the no-hole 2-distant coloring problem for Cayley graphs over finitely generated abelian groups. We give sufficient conditions for the existence of no-hole 2-distant colorings of such graphs, and obtain upper bounds for the minimum span nsp (Γ) by using a group-theoretic approach. © 2005 Elsevier B.V. All rights reserved.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
09.pdf
Size
23.43 KB
Format
Adobe PDF
Checksum
(MD5):45ab6ec3b58dca8e8e34e5cb71efa2b1