On the Achromatic Number of Honeycomb Networks

The achromatic number for a graph G= (V, E) is the largest integer m such that there is a partition of Vinto disjoint independent sets (V₁, V₂, …, V_m) satisfying the condition that for each pair of distinct sets V_i, V_j, V_i∪V_j is not an independent set in G. In this paper we present approximation algorithms to determine the achromatic number for honeycomb networks.