On arrow polynomials of checkerboard colorable virtual links

From MaRDI portal
Publication:5160467




Abstract: In this paper we give two new criteria of detecting the checkerboard colorability of virtual links by using odd writhe and arrow polynomial of virtual links, respectively. By applying new criteria, 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.









This page was built for publication: On arrow polynomials of checkerboard colorable virtual links

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160467)