Xian'an Jin

activity

20052026

most citedPartial-twuality polynomials of delta-matroids

4 citations · 20 across the 32 of their papers we have counts for

collaborators

Showing 2017Show all

4 papers · 1 filter

math.GT2017

Graphical virtual links and a polynomial of signed cyclic graphs

Qingying Deng, Xian'an Jin, Louis H Kauffman

For a signed cyclic graph G, we can construct a unique virtual link L by taking the medial construction and convert 4-valent vertices of the medial graph to crossings according to…

math.GT2017★ 2 cited

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

Meiqiao Zhang, Xian'an Jin, Qingying Deng

K. Ichihara and E. Matsudo introduced the notions of $Z$ -colorable links and the minimal coloring number for $Z$ -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…

math.CO2017

Several extreme coefficients of the Tutte polynomial of graphs

Helin Gong, Mengchen Li, Xian'an Jin

Let $t_{i, j}$ be the coefficient of $x^{i} y^{j}$ in the Tutte polynomial $T (G; x, y)$ of a connected bridgeless and loopless graph $G$ with order $n$ and size $m$ . It is trivial that $t_…

Graphical virtual links and a polynomial of signed cyclic graphs

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

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

Several extreme coefficients of the Tutte polynomial of graphs

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