Solutions to conjectures on the (k, ℓ)-rainbow index of complete graphs. - Qingqiong Cai; Xueliang Li 001; Jiangli Song (Networks, 2013)

Note on the upper bound of the rainbow index of a graph. - Qingqiong Cai; Xueliang Li 001; Yan Zhao 013 (Discret. Appl. Math., 2016)

The 3-rainbow index and connected dominating sets. - Qingqiong Cai; Xueliang Li 001; Yan Zhao 013 (J. Comb. Optim., 2016)

Rainbow connection numbers of ladders and Mobius ladders. - Qingqiong Cai; Yingbin Ma; Jiangli Song (Ars Comb., 2017)

Erdős-Gallai-type results for colorful monochromatic connectivity of a graph. - Qingqiong Cai; Xueliang Li 001; Di Wu (J. Comb. Optim., 2017)

On distances in vertex-weighted trees. - Qingqiong Cai; Fuyuan Cao; Tao Li 022; Hua Wang 003 (Appl. Math. Comput., 2018)

Some extremal results on the colorful monochromatic vertex-connectivity of a graph. - Qingqiong Cai; Xueliang Li 001; Di Wu (J. Comb. Optim., 2018)

Vertex-Critical ( P_5 P 5 , banner)-Free Graphs. - Qingqiong Cai; Shenwei Huang; Tao Li 022; Yongtang Shi (FAW, 2019)

Integer linear programming models for the weighted total domination problem. - Yuede Ma; Qingqiong Cai; Shunyu Yao 005 (Appl. Math. Comput., 2019)

Sum of weighted distances in trees. - Qingqiong Cai; Tao Li 022; Yongtang Shi; Hua Wang 003 (Discret. Appl. Math., 2019)

Some Results on k-Critical P5-Free Graphs. - Qingqiong Cai; Jan Goedgebeur; Shenwei Huang (CoRR, 2021)

Integer linear programming formulations for double roman domination problem. - Qingqiong Cai; Neng Fan; Yongtang Shi; Shunyu Yao 005 (Optim. Methods Softw., 2022)

Some results on k-critical P5-free graphs. - Qingqiong Cai; Jan Goedgebeur; Shenwei Huang (Discret. Appl. Math., 2023)

A self-supervised learning model for graph clustering optimization problems. - Qingqiong Cai; Xingyue Guo; Shenwei Huang (Knowl. Based Syst., 2024)

Learning to solve combinatorial optimization problems with heterophily. - Xingyue Guo; Pengfei Zhang; Qingqiong Cai; Ying Zhang (Neural Networks, 2025)