Ruifang Liu

collaborators

2 papers

math.CO2026

Extremal problems on $[a, b]$ -covered graphs

Qixuan Yuan, Ruifang Liu, Jinjiang Yuan

A graph $G$ is $[a, b]$ -covered if for each edge $e$ of $G$ there is an $[a, b]$ -factor containing it. For $a = b = 1$ , an $[a, b]$ -covered graph is a matching covered graph. The structur…

math.SP2025

Sufficient conditions of $k$ -leaf-connected graphs and spanning trees with bounded total $k$ -excess

Guoyan Ao, Ruifang Liu, Jinjiang Yuan

ChvÃ¡tal and ErdÃ¶s [Discrete Math. 2 (1972) 111-113] stated that, for an $m$ -connected graph $G$ , if its independence number $I^\pm (G) \leq m - 1$ , then $G$ is Hamilton-connected. Note…

Extremal problems on [a,b]-covered graphs

Sufficient conditions of k-leaf-connected graphs and spanning trees with bounded total k-excess

Extremal problems on $[a, b]$ -covered graphs

Sufficient conditions of $k$ -leaf-connected graphs and spanning trees with bounded total $k$ -excess