Coupon coloring of Kneser graph K(n,2).

Chen et al. [On coupon coloring of graphs, Discrete Appl. Math. 193 (2015) 94–101] had introduced the concept of coupon coloring for any graph with no isolated vertex. A k -coupon coloring of G is an assignment of colors from [ k ] : = { 1 , 2 , ... , k } to the vertices of G such that the neighborhood of every vertex of G contains vertices of all colors from [ k ]. The maximum k for which a k -coupon coloring exists is called the coupon coloring number of G , and is denoted by χ c (G). In this paper, we determine the coupon coloring number of Kneser graphs K (n , 2). [ABSTRACT FROM AUTHOR]