activity
20172021
most citedThe Minimal Coloring Number Of Any Non-splittable -colorable Link Is Four

2 citations · 2 across the 5 of their papers we have counts for

collaborators

6 papers

math.GT2021

One conjecture on cut points of virtual links and the arrow polynomial of twisted links

Qingying Deng

Checkerboard framings are an extension of checkerboard colorings for virtual links. According to checkerboard framings, in 2017, Dye obtained an independent invariant of virtual li…

math.GT2021

Projectors in the Virtual Temperley-Lieb Algebra

Qingying Deng, Xian'an Jin, Louis H. Kauffman

We present a method of defining projectors in the virtual Temperley-Lieb algebra, that generalizes the Jones-Wenzl projectors in Temperley-Lieb algebra. We show that the projectors…

math.GT2020

On arrow polynomials of checkerboard colorable virtual links

Qingying Deng, Xian'an Jin, Louis H. Kauffman

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 apply…

math.GT2018

The generalized Yamada polynomials of virtual spatial graphs

Qingying Deng, Xian'an Jin, Louis H. Kauffman

Classical knot theory can be generalized to virtual knot theory and spatial graph theory. In 2007, Fleming and Mellor combined virtual knot theory and spatial graph theory to form,…

math.GT20172 cited

The Minimal Coloring Number Of Any Non-splittable -colorable Link Is Four

Meiqiao Zhang, Xian'an Jin, Qingying Deng

K. Ichihara and E. Matsudo introduced the notions of -colorable links and the minimal coloring number for -colorable links, which is one of invariants for l…

math.CO2017

Characterizations of Eulerian and even-face partial duals of ribbon graphs

Qingying Deng, Xian'an Jin

Huggett and Moffatt characterized all bipartite partial duals of a plane graph in terms of all-crossing directions of its medial graph. Then Metsidik and Jin characterized all Eule…