Longest paths and cycles in bipartite oriented graphs. - Ke Min Zhang 001 (J. Graph Theory, 1987)

The value of the Ramsey number r(3, 8). - Brendan D. McKay; Ke Min Zhang 001 (J. Graph Theory, 1992)

Neighborhood unions and Hamiltonian properties. - Min Song Zeng; Ke Min Zhang 001 (Discret. Math., 1994)

Complementary cycles containing a fixed arc in diregular bipartite tournaments. - Ke Min Zhang 001; Yannis Manoussakis; Min Song Zeng (Discret. Math., 1994)

A new idea for Hamiltonian problem. - Min Song Zeng; Ke Min Zhang 001 (Ars Comb., 1996)

On the Arc-Pancyclicity of Local Tournaments. - Yue Hua Bu; Ke Min Zhang 001 (Ars Comb., 1997)

Edge-face chromatic number of plane graphs with high maximum degree. - Weifan Wang 001; Kemin Zhang 001 (Australas. J Comb., 1998)

New Upper Bounds for Ramsey Numbers. - Yi Ru Huang; Ke Min Zhang 001 (Eur. J. Comb., 1998)

The value of the Ramsey number R(Cn, K4) is 3(n-1)+1 (n≥4). - Jian Sheng Yang; Yi Ru Huang; Ke Min Zhang 001 (Australas. J Comb., 1999)

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. - Guofei Zhou; Kemin Zhang 001 (Australas. J Comb., 1999)

Completely Strong Path-Connectivity of Local Tournaments. - Yue Hua Bu; Ke Min Zhang 001 (Ars Comb., 1999)

On a conjecture involving cycle-complete graph Ramsey numbers. - Béla Bollobás; Chula J. Jayawardene; Jiansheng Yang; Yi Ru Huang; Cecil C. Rousseau; Ke Min Zhang 001 (Australas. J Comb., 2000)

On the Ramsey number R(Cn or Kn-1, Km) (m=3, 4). - Jian Sheng Yang; Yi Ru Huang; Ke Min Zhang 001 (Australas. J Comb., 2000)

A Sufficient Condition for Oriented Graphs to be Hamiltonian. - Linqiang Pan; Ke Min Zhang 001 (Ars Comb., 2000)

On (d, 2)-dominating numbers of binary undirected de Bruijn graphs. - Changhong Lu; Juming Xu; Kemin Zhang 001 (Discret. Appl. Math., 2000)

Pancyclic out-arcs of a Vertex in Tournaments. - Tianxing Yao; Yubao Guo; Kemin Zhang 001 (Discret. Appl. Math., 2000)

On Score Sequences ofk-Hypertournaments. - Guofei Zhou; Tianxing Yao; Kemin Zhang 001 (Eur. J. Comb., 2000)

A note on list improper coloring planar graphs. - Ko-Wei Lih; Zengmin Song; Wei-Fan Wang 001; Kemin Zhang 001 (Appl. Math. Lett., 2001)

A minimum broadcast graph on 26 vertices. - Jian-guo Zhou; Kemin Zhang 001 (Appl. Math. Lett., 2001)

A bound for multicolor Ramsey numbers. - Ling-sheng Shi; Kemin Zhang 001 (Discret. Math., 2001)

An Ore-type Condition for Cyclability. - Yaojun Chen; Yunqing Zhang; Kemin Zhang 001 (Eur. J. Comb., 2001)

R(C6, K5) = 21andR(C7, K5) = 25. - Jian Sheng Yang; Yi Ru Huang; Ke Min Zhang 001 (Eur. J. Comb., 2001)

Edge-pancyclicity of coupled graphs. - Ko-Wei Lih; Zengmin Song; Wei-Fan Wang 001; Kemin Zhang 001 (Discret. Appl. Math., 2002)

The Ramsey numbers R(Tn, W6) for Delta (Tn) geq n-3. - Yaojun Chen; Yunqing Zhang; Kemin Zhang 001 (Appl. Math. Lett., 2004)

The Ramsey numbers of stars versus wheels. - Yaojun Chen; Yunqing Zhang; Kemin Zhang 001 (Eur. J. Comb., 2004)

The Ramsey numbers of paths versus wheels. - Yaojun Chen; Yunqing Zhang; Kemin Zhang 001 (Discret. Math., 2005)

The Ramsey numbers of trees versus W6 or W7. - Yaojun Chen; Yunqing Zhang; Kemin Zhang 001 (Eur. J. Comb., 2006)

A note on Ramsey numbers with two parameters. - Yi Ru Huang; Jian Sheng Yang; Ke Min Zhang 001 (Eur. J. Comb., 2006)

New upper bound formulas with parameters for Ramsey numbers. - Yi Ru Huang; Yuandi Wang; Wancheng Sheng; Jian Sheng Yang; Kemin Zhang 001; Jian Huang (Discret. Math., 2007)

The Ramsey numbers for stars of even order versus a wheel of order nine. - Yunqing Zhang; Yaojun Chen; Kemin Zhang 001 (Eur. J. Comb., 2008)

The Ramsey number R(C8, K8). - Yunqing Zhang; Ke Min Zhang 001 (Discret. Math., 2009)