Before revision:  In particular, we prove that for every graph G, cr(G) \leq 10 implies cr_{2
After revision:  In particular, we prove that for every graph G, cr(G) \leq 10 is biplanar.