We stand with Ukraine  

Zhang Ke Min

According to our database1, Zhang Ke Min authored at least 8 papers between 1987 and 2001.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2001
<i>R</i>(C<sub>6</sub>, K<sub>5</sub>) = 21and<i>R</i>(C<sub>7</sub>, K<sub>5</sub>) = 25.
[BibTeX]
[DOI]
Jian Sheng Yang
,
Yi Ru Huang
,
Zhang Ke Min
Eur. J. Comb., 2001

2000
On the Ramsey number R(C<sub>n</sub> or K<sub>n-1</sub>, K<sub>m</sub>) (m=3, 4).
[BibTeX]
[DOI]
Jian Sheng Yang
,
Yi Ru Huang
,
Zhang Ke Min
Australas. J Comb., 2000

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

1999
Completely Strong Path-Connectivity of Local Tournaments.
[BibTeX]
Bu Yue Hua
,
Zhang Ke Min
Ars Comb., 1999

1997
On the Arc-Pancyclicity of Local Tournaments.
[BibTeX]
Bu Yue Hua
,
Zhang Ke Min
Ars Comb., 1997

1994
Neighborhood unions and Hamiltonian properties.
[BibTeX]
[DOI]
Min Song Zeng
,
Zhang Ke Min
Discret. Math., 1994

1992
The value of the Ramsey number <i>r</i>(3, 8).
[BibTeX]
[DOI]
Brendan D. McKay
,
Zhang Ke Min
J. Graph Theory, 1992

1987
Longest paths and cycles in bipartite oriented graphs.
[BibTeX]
[DOI]
Zhang Ke Min
J. Graph Theory, 1987


  Loading...