Minimum degree and size conditions for the proper connection number of graphs. - Xiaxia Guan; Lina Xue; Eddie Cheng 001; Weihua Yang (Appl. Math. Comput., 2019)

Anti-k-labeling of graphs. - Xiaxia Guan; Shurong Zhang; Rong-Hua Li; Lin Chen 002; Weihua Yang (Appl. Math. Comput., 2019)

Embedding planar 5-graphs in three pages. - Xiaxia Guan; Weihua Yang (Discret. Appl. Math., 2020)

A characterization of internally 4-connected {P10 - {V1, V2}}-minor-free graphs. - Xiaomin Zhou; Weihua Yang; Xiaxia Guan; Chengfu Qin (Discuss. Math. Graph Theory, 2023)

Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property $$P^{*}$$. - Ruiling Zheng; Xiaxia Guan; Xian'an Jin (J. Appl. Math. Comput., 2023)

On the polymatroid Tutte polynomial. - Xiaxia Guan; Weiling Yang; Xian'an Jin (J. Comb. Theory A, 2024)

The interior and exterior polynomials are well-defined. - Xiaxia Guan; Xian'an Jin; Tianlong Ma (Discret. Appl. Math., 2024)

Fractional matchings on regular graphs. - Xiaxia Guan; Tianlong Ma (J. Supercomput., 2024)

A direct proof of well-definedness for the polymatroid Tutte polynomial. - Xiaxia Guan; Xian'an Jin (Adv. Appl. Math., 2025)