Kemin Zhang

According to our database1, Kemin Zhang authored at least 19 papers between 1998 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Decentralized and Efficient Blockchain Rewriting with Bi-level Validity Verification.
Proceedings of the Security and Privacy in Communication Networks, 2022

2009
The Ramsey number R(C<sub>8</sub>, K<sub>8</sub>).
Discret. Math., 2009

2008
The Ramsey numbers for stars of even order versus a wheel of order nine.
Eur. J. Comb., 2008

2007
New upper bound formulas with parameters for Ramsey numbers.
Discret. Math., 2007

2006
A note on Ramsey numbers with two parameters.
Eur. J. Comb., 2006

The Ramsey numbers of trees versus <i>W</i><sub>6</sub> or <i>W</i><sub>7</sub>.
Eur. J. Comb., 2006

2005
The Ramsey numbers of paths versus wheels.
Discret. Math., 2005

2004
The Ramsey numbers of stars versus wheels.
Eur. J. Comb., 2004

The Ramsey numbers R(T<sub>n</sub>, W<sub>6</sub>) for Delta (T<sub>n</sub>) geq n-3.
Appl. Math. Lett., 2004

2002
Edge-pancyclicity of coupled graphs.
Discret. Appl. Math., 2002

2001
An Ore-type Condition for Cyclability.
Eur. J. Comb., 2001

A note on list improper coloring planar graphs.
Appl. Math. Lett., 2001

2000
On Score Sequences of<i>k</i>-Hypertournaments.
Eur. J. Comb., 2000

Pancyclic out-arcs of a Vertex in Tournaments.
Discret. Appl. Math., 2000

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

1999
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian.
Australas. J Comb., 1999

The value of the Ramsey number R(C<sub>n</sub>, K<sub>4</sub>) is 3(n-1)+1 (n≥4).
Australas. J Comb., 1999

1998
New Upper Bounds for Ramsey Numbers.
Eur. J. Comb., 1998

Edge-face chromatic number of plane graphs with high maximum degree.
Australas. J Comb., 1998


  Loading...