On Defect n-Extendable Bipartite Graphs. - Xuelian Wen (IMECS, 2007)

Path decomposition of defect 1-extendable bipartite graphs. - Xuelian Wen; Dingjun Lou (Australas. J Comb., 2007)

Characterizing defect n-extendable bipartite graphs with different connectivities. - Xuelian Wen; Dingjun Lou (Discret. Math., 2007)

Characterizing defect n-extendable graphs and (2n+1)-critical graphs. - Xuelian Wen; Dingjun Lou (Discret. Math., 2008)

Minimum degree of minimal defect n-extendable bipartite graphs. - Xuelian Wen; Zihui Yang (Discret. Math., 2009)

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)

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)