Qingqiong Cai

According to our database, Qingqiong Cai authored at least 13 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Some results on k-critical P5-free graphs.

Qingqiong Cai, Jan Goedgebeur, Shenwei Huang

Discret. Appl. Math., July, 2023

2022

Integer linear programming formulations for double roman domination problem.

Qingqiong Cai, Neng Fan, Yongtang Shi, Shunyu Yao

Optim. Methods Softw., 2022

2021

Some Results on k-Critical P₅-Free Graphs.

Qingqiong Cai, Jan Goedgebeur, Shenwei Huang

CoRR, 2021

2019

Sum of weighted distances in trees.

Qingqiong Cai, Tao Li, Yongtang Shi, Hua Wang

Discret. Appl. Math., 2019

Integer linear programming models for the weighted total domination problem.

Yuede Ma, Qingqiong Cai, Shunyu Yao

Appl. Math. Comput., 2019

Vertex-Critical ( P_5 P 5 , banner)-Free Graphs.

Qingqiong Cai, Shenwei Huang, Tao Li, Yongtang Shi

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018

Some extremal results on the colorful monochromatic vertex-connectivity of a graph.

Qingqiong Cai, Xueliang Li, Di Wu

J. Comb. Optim., 2018

On distances in vertex-weighted trees.

Qingqiong Cai, Fuyuan Cao, Tao Li, Hua Wang

Appl. Math. Comput., 2018

2017

Erdős-Gallai-type results for colorful monochromatic connectivity of a graph.

Qingqiong Cai, Xueliang Li, Di Wu

J. Comb. Optim., 2017

Rainbow connection numbers of ladders and Mobius ladders.

Qingqiong Cai, Yingbin Ma, Jiangli Song

Ars Comb., 2017

2016

The 3-rainbow index and connected dominating sets.

Qingqiong Cai, Xueliang Li, Yan Zhao

J. Comb. Optim., 2016

Note on the upper bound of the rainbow index of a graph.

Qingqiong Cai, Xueliang Li, Yan Zhao

Discret. Appl. Math., 2016

2013

Solutions to conjectures on the (<i>k</i>, ℓ)-rainbow index of complete graphs.

Qingqiong Cai, Xueliang Li, Jiangli Song

Networks, 2013