Open Neighborhood Coloring of a Generalized Antiprism Graph.

An open neighborhood coloring of a graph is a coloring in which vertices adjacent with a common vertex are colored differently. The minimum number of colors used in an open neighborhood coloring of a graph G is called the open neighborhood chromatic number of G. We determine this parameter for a generalization of the antiprism graph in this paper. [ABSTRACT FROM AUTHOR]