Rainbow Graphs and Switching Classes
arXiv:1108.6143 · doi:10.1137/110855089
Abstract
A rainbow graph is a graph that admits a vertex-coloring such that every color appears exactly once in the neighborhood of each vertex. We investigate some properties of rainbow graphs. In particular, we show that there is a bijection between the isomorphism classes of n-rainbow graphs on 2n vertices and the switching classes of graphs on n vertices.
Added more reference, fixed some typos (revision for journal submission)