Q. Yang

activity

20162023

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2023

Connectivity keeping trees in 3-connected bipartite graphs with girth conditions

Qing Yang, Yingzhi Tian

Luo, Tian and Wu conjectured in 2022 that for any tree $T$ with bipartition $X$ and $Y$ , every $k$ -connected bipartite graph $G$ with $δ (G) \geq k + t$ , where $t = \max\{|X|,|Y |\}…

math.CO2023

Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs

Qing Yang, Yingzhi Tian

Hasunuma [J. Graph Theory 102 (2023) 423-435] conjectured that for any tree $T$ of order $m$ , every $k$ -connected (or $k$ -edge-connected) graph $G$ with minimum degree at least $k+…

math.CO2022

Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

Qing Yang, Yingzhi Tian

A conjecture of Luo, Tian and Wu (2022) says that for every positive integer $k$ and every finite tree $T$ with bipartition $X$ and $Y$ (denote $t = max {∣ X ∣, ∣ Y ∣})$ , every $k$ -c…