1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs

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.