On Coupon Colorings of Graphs

Bob Chen, Jeong Han Kim, Michael Tait +1

Let $G$ be a graph with no isolated vertices. A {\em $k$-coupon coloring} of $G$ is an assignment of colors from $[k]:=\{1,2,\dots ,k\}$ to the vertices of $G$ such that the neigh…