In this paper, we give two new criteria of detecting the checkerboard colorability virtual links by using odd writhe and arrow polynomial links, respectively. As a result, prove that 6 knots are not colorable, leaving only one knot whose is unknown among all up to four classical crossings.