The packing chromatic number ??(G) of a graph G is the smallest integer k for which there exists vertex coloring ?:V(G)?{1,2,…,k} such that any two vertices color i are at distance least i+1. For g?{6,8,12}, (q+1,g)-Moore graphs (q+1)-regular with girth g incidence symmetric generalized g?2-gons order q. In this paper we study G. g=6 present exact value ??(G). g=8, determine in terms intersecti...