Yingzhi Tian

collaborators

3 papers

math.CO2026

Extremal graphs with no subgraph admitting $k + 1$ edge-disjoint spanning trees

Qinglin Wang, Yingzhi Tian

A graph $G$ is $I ¨ _{k}$ -maximal if $G$ contains no subgraph admitting $k + 1$ edge-disjoint spanning trees, while the addition of any edge in the complement of $G$ yields a subgraph th…

math.CO2026

Connectivity preserving spanning $(u, v)$ -paths in $k$ -connected graphs

Zhaolin Teng, Yingzhi Tian

Hasunuma [Graphs Combin. 41:10 (2025)] proved that for $k \geq 2$ , there exists a function $f (k) = O (k)$ such that every $k$ -connected graph $G$ of order $n \geq f (k)$ with $Î´(G)\ge \fr…

math.CO2026

The 3-restricted Edge-Connectivity of Strong Product Graphs

Wenxin Wang, Yingzhi Tian, Jing Wang

An edge subset $ S \subseteq E(G) $ is called a 3-restricted edge-cut if $G - S$ is disconnected and each component of $ G - S $ contains at least three vertices. The 3-restricte…

Extremal graphs with no subgraph admitting k+1 edge-disjoint spanning trees

Connectivity preserving spanning (u,v)-paths in k-connected graphs

The 3-restricted Edge-Connectivity of Strong Product Graphs

Extremal graphs with no subgraph admitting $k + 1$ edge-disjoint spanning trees

Connectivity preserving spanning $(u, v)$ -paths in $k$ -connected graphs