7 citations · 15 across the 9 of their papers we have counts for
9 papers
Construction, Extension and Paths of Near-Homogeneous Tournaments
Rongxia Tang, Zhaojun Chen, Zan-Bo Zhang
A homogeneous tournament is a tournament with vertices such that every arc is contained in exactly cycles of length . Homogeneous tournaments are the first class of…
Component factors in -free graphs
Guowei Dai, Zan-Bo Zhang, Xiaoyan Zhang
A graph is said to be -free if it does not contain an induced subgraph isomorphic to . An -factor is a spanning subgraph such that each connected…
k-Ary spanning trees contained in tournaments
Jiangdong Ai, Hui Lei, Yongtang Shi +2
A rooted tree is called a -ary tree, if all non-leaf vertices have exactly children, except possibly one non-leaf vertex has at most children. Denote by the min…
Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs
Zan-Bo Zhang, Xiaoyan Zhang, Xuelian Wen
In 1972, Woodall raised the following Ore type condition for directed Hamilton cycles in digraphs: Let be a digraph. If for every vertex pair and , where there is no arc…
M-alternating Hamilton paths and M-alternating Hamilton cycles
Zan-Bo Zhang, Yueping Li, Dingjun Lou
We study -alternating Hamilton paths and -alternating Hamilton cycles in a simple connected graph on vertices with a perfect matching . Let be a bipartite grap…
Minimum size of n-factor-critical graphs and k-extendable graphs
Zanbo Zhang, Xiaoyan Zhang, Dingjun Lou +1
We determine the minimum size of -factor-critical graphs and that of -extendable bipartite graphs, by considering Harary graphs and related graphs. Moreover, we determine the…