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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
