The distinguishing chromatic numbers of triangulations on the projective plane

摘要

A graph G is said to be d-distinguishing colorable if there is a coloring of G with d colors such that any automorphism of G except the identity map does not preserve the colors. We shall show that every triangulation on the projective plane is 7-distinguishing colorable, applying a re-embedding theory of triangulations on closed surfaces.