1 paper
Kanako Oshiro, Ayaka Shimizu, Yoshiro Yaguchi
We introduce an up-down coloring of a virtual-link diagram. The colorabilities give a lower bound of the minimum number of Reidemeister moves of type II which are needed between tw…