Bounds of the longest directed cycle length for minimal strong digraphs. - Zhibo Chen 003; Fuji Zhang (Discret. Math., 1988)

On uniquely 3-colorable graphs. - Chong-Yun Chao; Zhibo Chen 003 (Discret. Math., 1993)

On polynomial functions from Zn to Zm. - Zhibo Chen 003 (Discret. Math., 1995)

On polynomial functions from Zn1 × Zn2 × ... × Znr to Zm. - Zhibo Chen 003 (Discret. Math., 1996)

Harary's conjectures on integral sum graphs. - Zhibo Chen 003 (Discret. Math., 1996)

On uniquely 3-colorable graphs II. - Chong-Yun Chao; Zhibo Chen 003 (Discret. Math., 1998)

Integral sum graphs from identification. - Zhibo Chen 003 (Discret. Math., 1998)

Ordering graphs with small index and its application. - Fuji Zhang; Zhibo Chen 003 (Discret. Appl. Math., 2002)

On Integral Sum Graphs. - Zhibo Chen 003 (Electron. Notes Discret. Math., 2002)

On k-pairable graphs. - Zhibo Chen 003 (Discret. Math., 2004)

Transpositions and Representability. - Zhibo Chen 003; Gary L. Mullen (Am. Math. Mon., 2005)

On commutativity of two unary digraph operations: Subdividing and line-digraphing. - Fuji Zhang; Zhibo Chen 003 (Discret. Math., 2006)

Forcing faces in plane bipartite graphs. - Zhongyuan Che; Zhibo Chen 003 (Discret. Math., 2008)

On k-pairable regular graphs. - Zhongyuan Che; Zhibo Chen 003 (Discret. Math., 2010)

Forcing faces in plane bipartite graphs (II). - Zhongyuan Che; Zhibo Chen 003 (Discret. Appl. Math., 2013)

Sharp bounds on the size of pairable graphs and pairable bipartite graphs. - Zhongyuan Che; Zhibo Chen 003 (Australas. J Comb., 2015)

Minimum order of r-regular bipartite graphs of pair length k. - Zhongyuan Che; Zhibo Chen 003 (Australas. J Comb., 2016)

Forcing and anti-forcing edges in bipartite graphs. - Zhongyuan Che; Zhibo Chen 003 (Discret. Appl. Math., 2018)

Plane Elementary Bipartite Graphs with Forcing or Anti-forcing Edges. - Zhongyuan Che; Zhibo Chen 003 (Graphs Comb., 2019)

A decomposition structure of resonance graphs that are daisy cubes. - Zhongyuan Che; Zhibo Chen 003 (Discret. Appl. Math., 2025)