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