Ke Min Zhang

According to our database, Ke Min Zhang authored at least 31 papers between 1987 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2009

The Ramsey number R(C₈, K₈).

Yunqing Zhang, Ke Min Zhang

Discret. Math., 2009

2008

The Ramsey numbers for stars of even order versus a wheel of order nine.

Yunqing Zhang, Yaojun Chen, Kemin Zhang

Eur. J. Comb., 2008

2007

New upper bound formulas with parameters for Ramsey numbers.

Yi Ru Huang, Yuandi Wang, Wancheng Sheng, Jian Sheng Yang, Kemin Zhang, Jian Huang

Discret. Math., 2007

2006

A note on Ramsey numbers with two parameters.

Yi Ru Huang, Jian Sheng Yang, Ke Min Zhang

Eur. J. Comb., 2006

The Ramsey numbers of trees versus <i>W</i>₆ or <i>W</i>₇.

Yaojun Chen, Yunqing Zhang, Kemin Zhang

Eur. J. Comb., 2006

2005

The Ramsey numbers of paths versus wheels.

Yaojun Chen, Yunqing Zhang, Kemin Zhang

Discret. Math., 2005

2004

The Ramsey numbers of stars versus wheels.

Yaojun Chen, Yunqing Zhang, Kemin Zhang

Eur. J. Comb., 2004

The Ramsey numbers R(T_n, W₆) for Delta (T_n) geq n-3.

Yaojun Chen, Yunqing Zhang, Kemin Zhang

Appl. Math. Lett., 2004

2002

Edge-pancyclicity of coupled graphs.

Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang

Discret. Appl. Math., 2002

2001

<i>R</i>(C₆, K₅) = 21and<i>R</i>(C₇, K₅) = 25.

Jian Sheng Yang, Yi Ru Huang, Ke Min Zhang

Eur. J. Comb., 2001

An Ore-type Condition for Cyclability.

Yaojun Chen, Yunqing Zhang, Kemin Zhang

Eur. J. Comb., 2001

A bound for multicolor Ramsey numbers.

Ling-sheng Shi, Kemin Zhang

Discret. Math., 2001

A minimum broadcast graph on 26 vertices.

Jian-guo Zhou, Kemin Zhang

Appl. Math. Lett., 2001

A note on list improper coloring planar graphs.

Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang

Appl. Math. Lett., 2001

2000

On Score Sequences of<i>k</i>-Hypertournaments.

Guofei Zhou, Tianxing Yao, Kemin Zhang

Eur. J. Comb., 2000

Pancyclic out-arcs of a Vertex in Tournaments.

Tianxing Yao, Yubao Guo, Kemin Zhang

Discret. Appl. Math., 2000

On (d, 2)-dominating numbers of binary undirected de Bruijn graphs.

Changhong Lu, Juming Xu, Kemin Zhang

Discret. Appl. Math., 2000

A Sufficient Condition for Oriented Graphs to be Hamiltonian.

Linqiang Pan, Ke Min Zhang

Ars Comb., 2000

On the Ramsey number R(C_n or K_n-1, K_m) (m=3, 4).

Jian Sheng Yang, Yi Ru Huang, Ke Min Zhang

Australas. J Comb., 2000

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

Australas. J Comb., 2000

1999

Completely Strong Path-Connectivity of Local Tournaments.

Yue Hua Bu, Ke Min Zhang

Ars Comb., 1999

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian.

Guofei Zhou, Kemin Zhang

Australas. J Comb., 1999

The value of the Ramsey number R(C_n, K₄) is 3(n-1)+1 (n≥4).

Jian Sheng Yang, Yi Ru Huang, Ke Min Zhang

Australas. J Comb., 1999

1998

New Upper Bounds for Ramsey Numbers.

Yi Ru Huang, Ke Min Zhang

Eur. J. Comb., 1998

Edge-face chromatic number of plane graphs with high maximum degree.

Weifan Wang, Kemin Zhang

Australas. J Comb., 1998

1997

On the Arc-Pancyclicity of Local Tournaments.

Yue Hua Bu, Ke Min Zhang

Ars Comb., 1997

1996

A new idea for Hamiltonian problem.

Min Song Zeng, Ke Min Zhang

Ars Comb., 1996

1994

Complementary cycles containing a fixed arc in diregular bipartite tournaments.

Ke Min Zhang, Yannis Manoussakis, Min Song Zeng

Discret. Math., 1994

Neighborhood unions and Hamiltonian properties.

Min Song Zeng, Ke Min Zhang

Discret. Math., 1994

1992

The value of the Ramsey number <i>r</i>(3, 8).

Brendan D. McKay, Ke Min Zhang

J. Graph Theory, 1992

1987

Longest paths and cycles in bipartite oriented graphs.

Ke Min Zhang

J. Graph Theory, 1987