Jinze Hu

collaborators

2 papers

math.CO2025

Some results on minimum saturated graphs

Chenke Zhang, Qing Cui, Jinze Hu +2

Let $G$ be a graph and $F$ be a family of graphs. We say a graph $G$ is $F$ -saturated if $G$ does not contain any member in $F$ and for any $e\in E(\o…

math.CO2025

The saturation number of W 4

Ning Song, Jinze Hu, Shengjin Ji +1

For a fixed graph $H$ , a graph $G$ is called $H$ -saturated if $G$ does not contain $H$ as a (not necessarily induced) subgraph, but $G + e$ contains a copy of $H$ for any $e\in E(\ov…