Before revision:  To better understand the relation between crossing numbers and biplanar crossing numbers, we pose a new problem of finding the largest crossing number that implies biplanarity. In particular, we prove that for every graph G, cr(G) \leq 10 implies cr_{2
After revision:  To better understand the relation between crossing numbers and biplanar crossing number of general graphs in more depth, and prove that any graph with a crossing number of at most 10 implies cr_{2