Equivalence between Extendability and Factor-Criticality. - Zan-Bo Zhang; Tao Wang; Dingjun Lou (Ars Comb., 2007)

Notes on factor-critically, extendability and independence number. - Zan-Bo Zhang; Dingjun Lou; Xiaoyan Zhang 001 (Ars Comb., 2008)

M-alternating Hamilton paths and M-alternating Hamilton cycles. - Zan-Bo Zhang; Yueping Li; Dingjun Lou (Discret. Math., 2009)

Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility. - Xiaoyan Zhang 001; Zan-Bo Zhang; Xiaoxu Lu; Jing Li (Ars Comb., 2010)

M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities. - Xuelian Wen; Zan-Bo Zhang; Dingjun Lou (Discret. Math., 2011)

Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs. - Zan-Bo Zhang; Xiaoyan Zhang 001; Dingjun Lou; Xuelian Wen (Graphs Comb., 2012)

Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs. - Zan-Bo Zhang; Xiaoyan Zhang 001; Xuelian Wen (SIAM J. Discret. Math., 2013)

Triangle strings: Structures for augmentation of vertex-disjoint triangle sets. - Zan-Bo Zhang; Xiaoyan Zhang 001 (Inf. Process. Lett., 2014)

On the complexity of edge-colored subgraph partitioning problems in network optimization. - Xiaoyan Zhang 001; Zan-Bo Zhang; Hajo Broersma; Xuelian Wen (Discret. Math. Theor. Comput. Sci., 2016)

A polynomial time algorithm for cyclic vertex connectivity of cubic graphs. - Jun Liang 002; Dingjun Lou; Zan-Bo Zhang (Int. J. Comput. Math., 2017)

Extremal and Degree Conditions for Path Extendability in Digraphs. - Zan-Bo Zhang; Xiaoyan Zhang 001; Hajo Broersma; Dingjun Lou (SIAM J. Discret. Math., 2017)

An Improved Algorithm based on KNN and Random Forest. - Jun Liang 002; Qin Liu; Ruihua Nie; Biqing Zeng; Zan-Bo Zhang (CSAE, 2019)

k-Ary spanning trees contained in tournaments. - Jiangdong Ai; Hui Lei 002; Yongtang Shi; Shunyu Yao 005; Zan-Bo Zhang (Discret. Appl. Math., 2020)

Approximation algorithm for a generalized Roman domination problem in unit ball graphs. - Limin Wang; Yalin Shi; Zhao Zhang 002; Zan-Bo Zhang; Xiaoyan Zhang 001 (J. Comb. Optim., 2020)

The cubic graphs with finite cyclic vertex connectivity larger than girth. - Jun Liang 002; Dingjun Lou; Zan-Bo Zhang (Discret. Math., 2021)

Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments. - Zan-Bo Zhang; Xiaoyan Zhang 001; Gregory Z. Gutin; Dingjun Lou (J. Graph Theory, 2021)

Some degree conditions for 𝒫≥k-factor covered graphs. - Guowei Dai; Zan-Bo Zhang; Yicheng Hang; Xiaoyan Zhang 001 (RAIRO Oper. Res., 2021)

The Hamiltonian properties in K1, r-free split graphs. - Guowei Dai; Zan-Bo Zhang; Hajo Broersma; Xiaoyan Zhang 001 (Discret. Math., 2022)

Randomized selection algorithm for online stochastic unrelated machines scheduling. - Xiaoyan Zhang 001; Ran Ma; Jian Sun 022; Zan-Bo Zhang (J. Comb. Optim., 2022)

Sufficient conditions for graphs with {P2, P5}-factors. - Guowei Dai; Yicheng Hang; Xiaoyan Zhang 001; Zan-Bo Zhang; Wenqi Wang (RAIRO Oper. Res., 2022)

Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths. - Guowei Dai; Longkun Guo; Gregory Z. Gutin; Xiaoyan Zhang 001; Zan-Bo Zhang (IEEE Trans. Inf. Theory, 2022)

Fine-Tuned Heterogeneous Graph Convolutional Network Embedding. - Sha-Sha Zhang; Ai-Xiang Chen; Zan-Bo Zhang (ICMLC, 2023)

Remarks on component factors in K1,r-free graphs. - Guowei Dai; Zan-Bo Zhang; Xiaoyan Zhang (RAIRO Oper. Res., 2023)

A distributed message passing algorithm for computing perfect demand matching. - Guowei Dai; Yannan Chen; Yaping Mao; Dachuan Xu; Xiaoyan Zhang 001; Zan-Bo Zhang (J. Parallel Distributed Comput., 2023)

A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis. - Jian Sun 022; Zan-Bo Zhang; Yannan Chen; Deren Han; Donglei Du; Xiaoyan Zhang 001 (J. Glob. Optim., 2023)

A parallel PageRank algorithm for undirected graph. - Qi Zhang; Rongxia Tang; Zhengan Yao; Zan-Bo Zhang (Appl. Math. Comput., 2023)

Convergence and correctness of belief propagation for weighted min-max flow. - Guowei Dai; Longkun Guo; Gregory Z. Gutin; Xiaoyan Zhang 001; Zan-Bo Zhang (Discret. Appl. Math., 2024)

Cyclic edge and cyclic vertex connectivity of (4,5,6)-fullerene graphs. - Jun Liang 002; Xinyao Liu; Dingjun Lou; Zan-Bo Zhang; Zixin Qin (Discret. Appl. Math., 2024)

A survey on rainbow (vertex-)index of graphs. - Yan Zhao; Zan-Bo Zhang; Xiaoyan Zhang (Discret. Appl. Math., 2024)