3 papers
math.CO2026
Irreducibility of interlace polynomials
Jungang Chen, Xian'an Jin, Tianlong Ma
The factorisation of graph polynomials often reflects combinatorial decomposition. For a nonempty loopless graph , we first prove that the two-variable interlace polynomial $q(G…
math.CO2026
On the maximum twist width of delta-matroids
Xian'an Jin, Zhuo Li, Qi Yan +1
For a ribbon graph , let denote its Euler genus. Recently, Chen, Gross and Tucker [J. Algebraic Combin. 63 (2026) 13] derived a formula for the maximum partial-dual Eule…
math.CO2025
On the maximum partial-dual genus of a planar graph
Jiaying Chen, Xian'an Jin, Gang Zhang
Let be an embedded graph and an edge subset of . The partial dual of with respect to , denoted by , can be viewed as the geometric dual of over …