Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPing Zhao 0005
Person information
- affiliation: Linyi Normal University, School of Scienc, School of Mathematics and Statistics, China
Other persons with the same name
- Ping Zhao — disambiguation page
- Ping Zhao 0001
![[0000-0003-0907-9926]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-0907-9926")
— Donghua University, Engineering Research Center of Digitized Textile and Apparel Technology, Shanghai, China (and 2 more) - Ping Zhao 0002 — Shandong Normal University, School of Information Science and Engineering, Jinan, China (and 3 more)
- Ping Zhao 0003 — Beijing Technology and Business University, Multimedia Systems Laboratory School of Computer Science and Engineering, China (and 3 more)
- Ping Zhao 0004 — Beijing Jiaotong University, Department of Information and Communication Engineering, School of Science, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j15]Kefeng Diao, Fuliang Lu, Ping Zhao:
More results on the smallest one-realization of a given set II. Discuss. Math. Graph Theory 39(2): 473-487 (2019)- 2018
- [j14]Ping Zhao, Fuliang Lu, Vitaly I. Voloshin, Kefeng Diao:
On the Structure of Uniform One-Realizations of a Given Set. Graphs Comb. 34(1): 129-138 (2018) - 2017
- [j13]Kefeng Diao, Fuliang Lu, Vitaly I. Voloshin, Ping Zhao:
The Smallest Uniform Color-Bounded Hypergraphs Which are One-Realizations of a Given Set. Graphs Comb. 33(4): 869-883 (2017) - 2016
- [j12]Kefeng Diao, Vitaly I. Voloshin, Bing Xue, Ping Zhao:
On perfection and imperfection of one-realizations of a given set. Discret. Math. 339(10): 2417-2422 (2016) - [j11]Ping Zhao, Kefeng Diao, Fuliang Lu:
More Result on the Smallest One-Realization of a Given Set. Graphs Comb. 32(2): 835-850 (2016) - 2015
- [j10]Kefeng Diao, Vitaly I. Voloshin, Kaishun Wang, Ping Zhao:
The smallest one-realization of a given set IV. Discret. Math. 338(5): 712-724 (2015) - [j9]Ruixue Zhang, Ping Zhao, Kefeng Diao, Fuliang Lu:
The minimum chromatic spectrum of 3-uniform C-hypergraphs. J. Comb. Optim. 29(4): 796-802 (2015) - 2014
- [j8]Kefeng Diao, Ping Zhao, Kaishun Wang:
The Smallest One-Realization of a Given Set III. Graphs Comb. 30(4): 875-885 (2014) - 2012
- [j7]Ping Zhao, Kefeng Diao, Kaishun Wang:
The Smallest One-Realization of a Given Set. Electron. J. Comb. 19(1): 19 (2012) - [j6]Ping Zhao, Kefeng Diao, Renying Chang, Kaishun Wang:
The smallest one-realization of a given set II. Discret. Math. 312(19): 2946-2951 (2012) - 2011
- [j5]Ping Zhao, Kefeng Diao, Kaishun Wang:
The chromatic spectrum of 3-uniform bi-hypergraphs. Discret. Math. 311(23-24): 2650-2656 (2011) - [j4]Ping Zhao, Kefeng Diao, Kaishun Wang:
A generalization of Macula's disjunct matrices. J. Comb. Optim. 22(4): 495-498 (2011) - 2010
- [j3]Ping Zhao, Kefeng Diao:
Upper Chromatic Number of Steiner Triple Systems. Ars Comb. 97 (2010)
2000 – 2009
- 2006
- [j2]Kefeng Diao, Guizhen Liu, Dieter Rautenbach, Ping Zhao:
A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2. Discret. Math. 306(7): 670-672 (2006) - 2005
- [c1]Ping Zhao, Kefeng Diao:
On the Upper Chromatic Numbers of Mixed Interval Hypertrees. CJCDGCGT 2005: 272-277 - 2000
- [j1]Kefeng Diao, Ping Zhao, Huishan Zhou:
About the upper chromatic number of a co-hypergraph. Discret. Math. 220(1-3): 67-73 (2000)
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 01:31 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:
