Jing Guo

activity

20192025

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

Minimum degree of minimal (\emph{n}-10)-factor-critical graphs

Jing Guo, Heping Zhang

A graph $G$ of order $n$ is said to be $k$ -factor-critical for integers $1 \leq k < n$ , if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$ -factor-c…

math.CO2022

Minimally k-factor-critical graphs for some large k

Jing Guo, Heping Zhang

A graph $G$ of order $n$ is said to be $k$ -factor-critical for integers $1 \leq k < n$ , if the removal of any $k$ vertices results in a graph with a perfect matching. $1$ - and $2$ -f…