The L(2, 1, 1)-labellings of caterpillars. - Xiaoling Zhang 010; Kecai Deng (Int. J. Comput. Math. Comput. Syst. Theory, 2016)

Characterization results for L(2, 1, 1)-labeling problem on trees. - Kecai Deng; Xiaoling Zhang 010 (Discuss. Math. Graph Theory, 2017)

Distance two labelings in regular bipartite graphs. - Xiaoling Zhang 010; Kecai Deng (Ars Comb., 2018)

On Critical Circuits in k-Connected Matroids. - João Paulo Costalonga; Kecai Deng; Xiangqian Zhou (Graphs Comb., 2018)

Strong edge-coloring for planar graphs with large girth. - Lily Chen; Kecai Deng; Gexin Yu; Xiangqian Zhou (Discret. Math., 2019)

Caterpillars with maximum degree 3 are antimagic. - Kecai Deng; Yunfei Li (Discret. Math., 2019)

Recent progress on strong edge-coloring of graphs. - Kecai Deng; Gexin Yu; Xiangqian Zhou (Discret. Math. Algorithms Appl., 2019)

On the extremal values for the Mostar index of trees with given degree sequence. - Kecai Deng; Shuchao Li (Appl. Math. Comput., 2021)

Antimagic labeling of some biregular bipartite graphs. - Kecai Deng; Yunfei Li (Discuss. Math. Graph Theory, 2022)

The maximum Mostar indices of unicyclic graphs with given diameter. - Guorong Liu; Kecai Deng (Appl. Math. Comput., 2023)

The 1-2 conjecture holds for regular graphs. - Kecai Deng; Hongyuan Qiu (J. Comb. Theory B, 2025)

On the (1,25)-packing edge-colorings of claw-free subcubic graphs. - Lily Chen; Kecai Deng; Chenghao Nan; Yi Tan; Xiangqian Zhou (Discret. Math., 2026)