Xian'an Jin

activity

20242026

collaborators

4 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 $G$ , 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 $G$ , let $I^^{3} (G)$ 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 $G$ be an embedded graph and $A$ an edge subset of $G$ . The partial dual of $G$ with respect to $A$ , denoted by $G^{A}$ , can be viewed as the geometric dual $G^{*}$ of $G$ over $A$ …

math.CO2024

Isolation partitions in graphs

Gang Zhang, Weiling Yang, Xian'an Jin

Let $G$ be a graph and $k \geq 3$ an integer. A subset $D \subseteq V (G)$ is a $k$ -clique (resp., cycle) isolating set of $G$ if $G - N [D]$ contains no $k$ -clique (resp., cycle). In…