Distance coloring of the hexagonal lattice

Jacko, Peter and Jendrol', Stanislav (2005) Distance coloring of the hexagonal lattice. Discussiones Mathematicae Graph Theory, 25 (1-2). pp. 151-166. ISSN 1234-3099

[img]
Preview
PDF (Article_cameraready)
Article_cameraready.pdf - Accepted Version

Download (170kB)

Abstract

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.

Item Type: Journal Article
Journal or Publication Title: Discussiones Mathematicae Graph Theory
Uncontrolled Keywords: /dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
Departments: Lancaster University Management School > Management Science
ID Code: 71359
Deposited By: ep_importer_pure
Deposited On: 21 Oct 2014 13:22
Refereed?: Yes
Published?: Published
Last Modified: 19 Feb 2020 02:16
URI: https://eprints.lancs.ac.uk/id/eprint/71359

Actions (login required)

View Item View Item