Open neighborhood chromatic number of an antiprism graph
Narahari Narasimha Swamy, B. Sooryanarayana, Geetha Kempanapura, Nanjunda Swamy · 2015
An open neighborhood k-coloring of a simple connected undirected graph G(V,E) is a k-coloring c : V ! {1,2,··· ,k}, such that, for every w 2 V and for all u,v 2 N(w), c(u) 6 c(v). The minimum value of k for which G admits an open neighborhood k-coloring is called the open neighborhood chromatic num