Jing Guo

activity

20192025

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2025

The minimum degree of minimal 2-extendable claw-free graphs

Jing Guo, Fuliang Lu, Heping Zhang

A connected graph $G$ with a perfect matching is said to be $k$ -extendable for integers $k$ , $1 \leq k \leq \frac{∣ V ( G ) ∣}{2} - 1$ , if any matching in $G$ of size $k$ is contained in a…

math.CO2023

The minimum degree of minimal $k$ -factor-critical claw-free graphs*

Jing Guo, Qiuli Li, Fuliang Lu +1

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-cr…

math.CO2023

Cubic vertices of minimal bicritical graphs

Jing Guo, Hailun Wu, Heping Zhang

A graph $G$ with four or more vertices is called bicritical if the removal of any pair of distinct vertices of $G$ results in a graph with a perfect matching. A bicritical graph is…

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.CO2019

Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks THLNs

Huifeng Zhang, Xirong Xu, Jing Guo +1

The twisted hypercube-like networks( $T H L N s$ ) contain several important hypercube variants. This paper is concerned with the fault-tolerant path-embedding of $n$ -dimensional( $n$ - $D$ …

The minimum degree of minimal 2-extendable claw-free graphs

The minimum degree of minimal k-factor-critical claw-free graphs*

Cubic vertices of minimal bicritical graphs

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

Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks THLNs

The minimum degree of minimal $k$ -factor-critical claw-free graphs*