2-local distributed algorithms for generalized coloring of hexagonal graphs

A 2-local distributed approximation algorithm for multicoloring of a triangle-free hexagonal graph which uses at most ⌈(5/4)ω(G)⌉+3 colors is presented.