| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652752 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
Hexagonal graphs are graphs induced on subsets of vertices of triangular lattice. They arise naturally in studies of cellular networks. We present a 1-local 7/5-competitive distributed algorithm for multicoloring a hexagonal graph, thereby improving the previous 1-local 17/12-competitive algorithm.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
