Xiaoyan Zhang

collaborators

2 papers

math.CO2025

Path Extendable Tournaments

Zan-Bo Zhang, Weihua He, Hajo Broersma +1

A digraph $D$ is called \emph{path extendable} if for every nonhamiltonian (directed) path $P$ in $D$ , there exists another path $P^{'}$ with the same initial and terminal verti…

math.CO2020

Component factors in $K_{1, r}$ -free graphs

Guowei Dai, Zan-Bo Zhang, Xiaoyan Zhang

A graph is said to be $K_{1, r}$ -free if it does not contain an induced subgraph isomorphic to $K_{1, r}$ . An $F$ -factor is a spanning subgraph $H$ such that each connected…

Path Extendable Tournaments

Component factors in K1,r​-free graphs

Component factors in $K_{1, r}$ -free graphs