Quanru Pan

collaborators

2 papers

math.CO2026

Spectral radius and perfect k-matchings in t-connected graphs

Quanru Pan, Sizhong Zhou

A $k$ -matching of a graph $G$ is a function $f : E (G) \to {0, 1, 2, \dots, k}$ with $e \in E_{G} (v) \sum f (e) \leq k$ for each vertex $v$ of $G$ , where $E_{G} (v)$ is the set o…

math.CO2019

A result on fractional (a,b,k)-critical covered graphs

Sizhong Zhou, Quanru Pan

For a graph $G$ , the set of vertices in $G$ is denoted by $V (G)$ , and the set of edges in $G$ is denoted by $E (G)$ . A fractional $[a, b]$ -factor of a graph $G$ is a function $h$ fro…