Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhibo Chen 0003
Person information
- affiliation: Penn State University, Department of Mathematics, McKeesport, PA, USA
Other persons with the same name
- Zhibo Chen 0001
![[0000-0002-8525-5066]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-8525-5066")
— University of Science and Technology of China, Hefei, China (and 3 more) - Zhibo Chen 0002 — University of Houston, Department of Computer Science, TX, USA
- Zhibo Chen 0004 — Beijing Forestry University, School of Information Science and Technology, China
- Zhibo Chen 0005 — Yunnan University, School of Software, China
- Zhibo Chen 0006 — Tencent YouTu Lab, China
- Zhibo Chen 0007 — University of PLA, College of Communication Army Engineering, Nanjing, China
- Zhibo Chen 0008 — Fudan University, State Key Laboratory of ASIC and System, Shanghai, China
- Zhibo Chen 0009 — Carnegie Mellon University, PA, USA
- Zhibo Chen 0010 — China Agricultural University, College of Information and Electrical Engineering, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j20]Zhongyuan Che, Zhibo Chen:
Plane Elementary Bipartite Graphs with Forcing or Anti-forcing Edges. Graphs Comb. 35(4): 959-971 (2019)- 2018
- [j19]Zhongyuan Che, Zhibo Chen:
Forcing and anti-forcing edges in bipartite graphs. Discret. Appl. Math. 244: 70-77 (2018) - 2016
- [j18]Zhongyuan Che, Zhibo Chen:
Minimum order of r-regular bipartite graphs of pair length k. Australas. J Comb. 66: 50-65 (2016) - 2015
- [j17]Zhongyuan Che, Zhibo Chen:
Sharp bounds on the size of pairable graphs and pairable bipartite graphs. Australas. J Comb. 62: 172-183 (2015) - 2013
- [j16]Zhongyuan Che, Zhibo Chen:
Forcing faces in plane bipartite graphs (II). Discret. Appl. Math. 161(1-2): 71-80 (2013) - 2010
- [j15]Zhongyuan Che, Zhibo Chen:
On k-pairable regular graphs. Discret. Math. 310(23): 3334-3350 (2010) - 2008
- [j14]Zhongyuan Che, Zhibo Chen:
Forcing faces in plane bipartite graphs. Discret. Math. 308(12): 2427-2439 (2008) - 2006
- [j13]Zhibo Chen:
On integral sum graphs. Discret. Math. 306(1): 19-25 (2006) - [j12]Fuji Zhang, Zhibo Chen:
On commutativity of two unary digraph operations: Subdividing and line-digraphing. Discret. Math. 306(21): 2733-2739 (2006) - 2005
- [j11]Zhibo Chen, Gary L. Mullen:
Transpositions and Representability. Am. Math. Mon. 112(10): 913-919 (2005) - 2004
- [j10]Zhibo Chen:
On k-pairable graphs. Discret. Math. 287(1-3): 11-15 (2004) - 2002
- [j9]Fuji Zhang, Zhibo Chen:
Ordering graphs with small index and its application. Discret. Appl. Math. 121(1-3): 295-306 (2002) - [j8]Zhibo Chen:
On Integral Sum Graphs. Electron. Notes Discret. Math. 11: 117-127 (2002) - 1998
- [j7]Zhibo Chen:
Integral sum graphs from identification. Discret. Math. 181(1-3): 77-90 (1998) - [j6]Chong-Yun Chao, Zhibo Chen:
On uniquely 3-colorable graphs II. Discret. Math. 189(1-3): 259-265 (1998) - 1996
- [j5]Zhibo Chen:
Harary's conjectures on integral sum graphs. Discret. Math. 160(1-3): 241-244 (1996) - [j4]Zhibo Chen:
On polynomial functions from Zn1 × Zn2 × ... × Znr to Zm. Discret. Math. 162(1-3): 67-76 (1996) - 1995
- [j3]Zhibo Chen:
On polynomial functions from Zn to Zm. Discret. Math. 137(1-3): 137-145 (1995) - 1993
- [j2]Chong-Yun Chao, Zhibo Chen:
On uniquely 3-colorable graphs. Discret. Math. 112(1-3): 21-27 (1993) - 1988
- [j1]Zhibo Chen, Fuji Zhang:
Bounds of the longest directed cycle length for minimal strong digraphs. Discret. Math. 68(1): 9-13 (1988)
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-10 23:23 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:
