Qingqiong Cai

activity

20122024

most citedErdős-Gallai-type results for colorful monochromatic connectivity of a graph

1 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2024

Monochromatic $k$ -connection of graphs

Qingqiong Cai, Shinya Fujita, Henry Liu +1

An edge-coloured path is monochromatic if all of its edges have the same colour. For a $k$ -connected graph $G$ , the monochromatic $k$ -connection number of $G$ , denoted by $m c_{k} (G)$ …

math.CO2014★ 1 cited

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

Qingqiong Cai, Xueliang Li, Di Wu

A path in an edge-colored graph is called a \emph{monochromatic path} if all the edges on the path are colored the same. An edge-coloring of $G$ is a \emph{monochromatic connection…

math.CO2014

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

Qingqiong Cai, Xueliang Li, Yan Zhao

A path in an edge-colored graph $G$ , where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number…

math.CO2014★ 1 cited

The 3-rainbow index and connected dominating sets

Qingqiong Cai, Xueliang Li, Yan Zhao

A tree in an edge-colored graph is said to be rainbow if no two edges on the tree share the same color. An edge-coloring of $G$ is called 3-rainbow if for any three vertices in $G$ …

math.CO2012

Solutions to conjectures on the $(k, ℓ)$ -rainbow index of complete graphs

Qingqiong Cai, Xueliang Li, Jiangli Song

The $(k, ℓ)$ -rainbow index $r x_{k, ℓ} (G)$ of a graph $G$ was introduced by Chartrand et. al. For the complete graph $K_{n}$ of order $n \geq 6$ , they showed that $rx_{3,\ell}(K_n…