default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKemin Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c1]Kemin Zhang, Li Yang, Lu Zhou, Jianfeng Ma:
Decentralized and Efficient Blockchain Rewriting with Bi-level Validity Verification. SecureComm 2022: 309-328
2000 – 2009
- 2009
- [j18]Yunqing Zhang, Kemin Zhang:
The Ramsey number R(C8, K8). Discret. Math. 309(5): 1084-1090 (2009) - 2008
- [j17]Yunqing Zhang, Yaojun Chen, Kemin Zhang:
The Ramsey numbers for stars of even order versus a wheel of order nine. Eur. J. Comb. 29(7): 1744-1754 (2008) - 2007
- [j16]Yi Ru Huang, Yuandi Wang
, Wancheng Sheng, Jian Sheng Yang, Kemin Zhang, Jian Huang:
New upper bound formulas with parameters for Ramsey numbers. Discret. Math. 307(6): 760-763 (2007) - 2006
- [j15]Yaojun Chen, Yunqing Zhang, Kemin Zhang:
The Ramsey numbers of trees versus W6 or W7. Eur. J. Comb. 27(4): 558-564 (2006) - [j14]Yi Ru Huang, Jian Sheng Yang, Kemin Zhang:
A note on Ramsey numbers with two parameters. Eur. J. Comb. 27(4): 574-576 (2006) - 2005
- [j13]Yaojun Chen, Yunqing Zhang, Kemin Zhang:
The Ramsey numbers of paths versus wheels. Discret. Math. 290(1): 85-87 (2005) - 2004
- [j12]Yaojun Chen, Yunqing Zhang, Kemin Zhang:
The Ramsey numbers R(Tn, W6) for Delta (Tn) geq n-3. Appl. Math. Lett. 17(3): 281-285 (2004) - [j11]Yaojun Chen, Yunqing Zhang, Kemin Zhang:
The Ramsey numbers of stars versus wheels. Eur. J. Comb. 25(7): 1067-1075 (2004) - 2002
- [j10]Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang:
Edge-pancyclicity of coupled graphs. Discret. Appl. Math. 119(3): 259-264 (2002) - 2001
- [j9]Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang:
A note on list improper coloring planar graphs. Appl. Math. Lett. 14(3): 269-273 (2001) - [j8]Yaojun Chen, Yunqing Zhang, Kemin Zhang:
An Ore-type Condition for Cyclability. Eur. J. Comb. 22(7): 953-960 (2001) - 2000
- [j7]Tianxing Yao, Yubao Guo, Kemin Zhang:
Pancyclic out-arcs of a Vertex in Tournaments. Discret. Appl. Math. 99(1-3): 245-249 (2000) - [j6]Changhong Lu, Juming Xu, Kemin Zhang:
On (d, 2)-dominating numbers of binary undirected de Bruijn graphs. Discret. Appl. Math. 105(1-3): 137-145 (2000) - [j5]Guofei Zhou, Tianxing Yao, Kemin Zhang:
On Score Sequences ofk-Hypertournaments. Eur. J. Comb. 21(8): 993-1000 (2000)
1990 – 1999
- 1999
- [j4]Guofei Zhou, Kemin Zhang:
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. Australas. J Comb. 19: 231-234 (1999) - [j3]Jian Sheng Yang, Yi Ru Huang, Kemin Zhang:
The value of the Ramsey number R(Cn, K4) is 3(n-1)+1 (n≥4). Australas. J Comb. 20: 205-206 (1999) - 1998
- [j2]Weifan Wang, Kemin Zhang:
Edge-face chromatic number of plane graphs with high maximum degree. Australas. J Comb. 18: 235-244 (1998) - [j1]Yi Ru Huang, Kemin Zhang:
New Upper Bounds for Ramsey Numbers. Eur. J. Comb. 19(3): 391-394 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
