Zhongmei Qin

activity

20152024

most citedExact rainbow numbers for matchings in plane triangulations

3 citations · 4 across the 5 of their papers we have counts for

collaborators

10 papers

math.CO2024★ 1 cited

A complete characterization of split digraphs with a strong arc decomposition

Jiangdong Ai, Fankang He, Zhaoxiang Li +2

A \textbf{strong arc decomposition} of a (multi-)digraph $D (V, A)$ is a partition of its arc set $A$ into two disjoint arc sets $A_{1}$ and $A_{2}$ such that both of the spanning subdi…

math.CO2019★ 3 cited

Exact rainbow numbers for matchings in plane triangulations

Zhongmei Qin, Yongxin Lan, Yongtang Shi +1

Given two graphs $G$ and $H$ , the {\it rainbow number} $r b (G, H)$ for $H$ with respect to $G$ is defined as the minimum number $k$ such that any $k$ -edge-coloring of $G$ contains a…

math.CO2018

Improved bounds for rainbow numbers of matchings in plane triangulations

Zhongmei Qin, Yongxin Lan, Yongtang Shi

Given two graphs $G$ and $H$ , the {\it rainbow number} $r b (G, H)$ for $H$ with respect to $G$ is defined as the minimum number $k$ such that any $k$ -edge-coloring of $G$ contains a…

math.CO2018

Degree powers in graphs with a forbidden forest

Yongxin Lan, Henry Liu, Zhongmei Qin +1

Given a positive integer $p$ and a graph $G$ with degree sequence $d_{1}, \dots, d_{n}$ , we define $e_{p} (G) = \sum_{i = 1}^{n} d_{i}^{p}$ . Caro and Yuster introduced a Turán-type problem for $e_p(G…

math.CO2017

The Turan number of 2P_7

Yongxin Lan, Zhongmei Qin, Yongtang Shi

The Turán number of a graph $H$ , denoted by $e x (n, H)$ , is the maximum number of edges in any graph on $n$ vertices which does not contain $H$ as a subgraph. Let $P_{k}$ denote the…

math.CO2016

The $(k, ℓ)$ -proper index of graphs

Hong Chang, Xueliang Li, Colton Magnant +1

A tree $T$ in an edge-colored graph is called a {\it proper tree} if no two adjacent edges of $T$ receive the same color. Let $G$ be a connected graph of order $n$ and $k$ be an in…