Qingqiong Cai

Orcid: 0000-0002-3170-7004

According to our database1, Qingqiong Cai authored at least 14 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A self-supervised learning model for graph clustering optimization problems.
Knowl. Based Syst., 2024

2023
Some results on k-critical P5-free graphs.
Discret. Appl. Math., July, 2023

2022
Integer linear programming formulations for double roman domination problem.
Optim. Methods Softw., 2022

2021
Some Results on k-Critical P<sub>5</sub>-Free Graphs.
CoRR, 2021

2019
Sum of weighted distances in trees.
Discret. Appl. Math., 2019

Integer linear programming models for the weighted total domination problem.
Appl. Math. Comput., 2019

Vertex-Critical ( P_5 P 5 , banner)-Free Graphs.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018
Some extremal results on the colorful monochromatic vertex-connectivity of a graph.
J. Comb. Optim., 2018

On distances in vertex-weighted trees.
Appl. Math. Comput., 2018

2017
Erdős-Gallai-type results for colorful monochromatic connectivity of a graph.
J. Comb. Optim., 2017

Rainbow connection numbers of ladders and Mobius ladders.
Ars Comb., 2017

2016
The 3-rainbow index and connected dominating sets.
J. Comb. Optim., 2016

Note on the upper bound of the rainbow index of a graph.
Discret. Appl. Math., 2016

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


  Loading...