Yu-Zhen Qi

collaborators

2 papers

math.CO2024

Bipartitions with prescribed order of highly connected digraphs

Yuzhen Qi, Jin Yan, Jia Zhou

A digraph is strongly connected if it has a directed path from $x$ to $y$ for every ordered pair of distinct vertices $x, y$ and it is strongly $k$ -connected if it has at least $k+…

math.CO2024

Removal paths avoiding vertices

Yuzhen Qi, Jin Yan

In this paper, we show that for any positive integer $m$ and $k \in [2]$ , let $G$ be a $(2 m + 2 k + 2)$ -connected graph and let $a_{1}, \dots, a_{m}, s, t$ be any distinct vertices of $G$ ,…