  Given two regular graphs with consistent rotation maps, we produce a
constructive method for a consistent rotation map on their Cartesian product.
This method will be given as a simple set of rules of addition and table look
ups. We assume that the combinatorial construction of both consistent rotation
maps has occurred before we construct the Cartesian product.
