Pseudo-Achromatic Number of Honeycomb Derived Networks

The Pseudo-Achromatic number ψ_s G of a graph G is the maximum number of colors which may be assigned to the vertices of G so that for every two colors, there exists adjacent vertices to which these colors are assigned (adjacent vertices may have the same color). This paper formulates an O(1)-approximation algorithm for the Pseudo-Achromatic number of honeycomb derived networks.