Yingzhi Tian

activity

20202026

k

-connected bipartite graphs

1 citations · 1 across the 9 of their papers we have counts for

collaborators

9 papers

math.CO2026

Hamiltonian cycles and Hamiltonian paths in $2 k$ -connected, $1$ -tough and $(P_{3} \cup k P_{1})$ -free graphs

Hui Liu, Yingzhi Tian

A graph $G$ is called Hamiltonian if it possesses a Hamiltonian cycle; and $G$ is called Hamiltonian-connected if it contains a Hamiltonian path between any two distinct vertices.…

math.CO2026

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

Qinglin Wang, Yingzhi Tian

A graph $G$ is $τ_{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 tha…

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 \fra…

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…

math.CO2024

Graphs with a given conditional diameter that maximize the Wiener index

Junfeng An, Yingzhi Tian

The Wiener index $W (G)$ of a graph $G$ is one of the most well-known topological indices, which is defined as the sum of distances between all pairs of vertices of $G$ . The diamete…

math.CO2024

The Restricted Edge-Connectivity of Strong Product Graphs

Hazhe Ye, Yingzhi Tian

The restricted edge-connectivity of a connected graph $G$ , denoted by $λ^{'} (G)$ , if it exists, is the minimum cardinality of a set of edges whose deletion makes $G$ disconnec…

math.CO2023

Edge-connectivity keeping trees in $k$ -edge-connected graphs

Qing Yang, Yingzhi Tian

Mader [J. Combin. Theory Ser. B 40 (1986) 152-158] proved that every $k$ -edge-connected graph $G$ with minimum degree at least $k + 1$ contains a vertex $u$ such that $G - {u}$ is st…

math.CO2023

Characterizing the forbidden pairs for graphs to be super-edge-connected

Hazhe Ye, Yingzhi Tian

Let $H$ be a set of given connected graphs. A graph $G$ is said to be $H$ -free if $G$ contains no $H$ as an induced subgraph for any $H \in H$ . The gra…

math.CO2020★ 1 cited

Connectivity keeping paths in $k$ -connected bipartite graphs

Lian Luo, Yingzhi Tian, Liyun Wu

In 2010, Mader [W. Mader, Connectivity keeping paths in $k$ -connected graphs, J. Graph Theory 65 (2010) 61-69.] proved that every $k$ -connected graph $G$ with minimum degree at lea…

Hamiltonian cycles and Hamiltonian paths in 2k-connected, 1-tough and (P3​∪kP1​)-free graphs

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

Graphs with a given conditional diameter that maximize the Wiener index

The Restricted Edge-Connectivity of Strong Product Graphs

Edge-connectivity keeping trees in k-edge-connected graphs

Characterizing the forbidden pairs for graphs to be super-edge-connected

Connectivity keeping paths in k-connected bipartite graphs

Hamiltonian cycles and Hamiltonian paths in $2 k$ -connected, $1$ -tough and $(P_{3} \cup k P_{1})$ -free graphs

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

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

Edge-connectivity keeping trees in $k$ -edge-connected graphs

Connectivity keeping paths in $k$ -connected bipartite graphs