default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhongyuan Che
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Simon Brezovnik, Zhongyuan Che, Niko Tratnik
, Petra Zigert Pletersek:
Outerplane bipartite graphs with isomorphic resonance graphs. Discret. Appl. Math. 343: 340-349 (2024)- [j22]Zhongyuan Che, Chong Peng, Thunshun W. Liao, Jikun Wang:
Improving milling tool wear prediction through a hybrid NCA-SMA-GRU deep learning model. Expert Syst. Appl. 255: 124556 (2024) - [c1]Rui Zhang, Chong Peng, Zhongyuan Che:
CPCRNet: Cross-source Point Cloud Completion-registration Network for Intelligent Factory Virtual Scene Construction. ISIE 2024: 1-5 - 2023
- [j21]Zhongyuan Che:
(k+1)-line graphs of k-trees. Australas. J Comb. 87: 12-23 (2023) - [j20]Chong Peng, Zhongyuan Che, Thunshun W. Liao, Zhongwen Zhang:
Prediction using multi-objective slime mould algorithm optimized support vector regression model. Appl. Soft Comput. 145: 110580 (2023) - [j19]Allan Bickle, Zhongyuan Che:
Irregularities of maximal k-degenerate graphs. Discret. Appl. Math. 331: 70-87 (2023) - 2022
- [j18]Zhongyuan Che:
k-Wiener index of a k-plex. J. Comb. Optim. 43(1): 65-78 (2022) - 2021
- [j17]Allan Bickle, Zhongyuan Che:
Wiener Indices of Maximal k-Degenerate Graphs. Graphs Comb. 37(2): 581-589 (2021) - [j16]Zhongyuan Che:
Peripheral Convex Expansions of Resonance Graphs. Order 38(3): 365-376 (2021) - 2020
- [j15]Zhongyuan Che:
Cube-free resonance graphs. Discret. Appl. Math. 284: 262-268 (2020)
2010 – 2019
- 2019
- [j14]Zhongyuan Che, Karen L. Collins:
An upper bound on Wiener Indices of maximal planar graphs. Discret. Appl. Math. 258: 76-86 (2019) - [j13]Zhongyuan Che:
A characterization of the resonance graph of an outerplane bipartite graph. Discret. Appl. Math. 258: 264-268 (2019) - [j12]Zhongyuan Che, Zhibo Chen:
Plane Elementary Bipartite Graphs with Forcing or Anti-forcing Edges. Graphs Comb. 35(4): 959-971 (2019) - 2018
- [j11]Zhongyuan Che, Zhibo Chen:
Forcing and anti-forcing edges in bipartite graphs. Discret. Appl. Math. 244: 70-77 (2018) - [j10]Zhongyuan Che:
Structural properties of resonance graphs of plane elementary bipartite graphs. Discret. Appl. Math. 247: 102-110 (2018) - 2016
- [j9]Zhongyuan Che, Zhibo Chen:
Minimum order of r-regular bipartite graphs of pair length k. Australas. J Comb. 66: 50-65 (2016) - 2015
- [j8]Zhongyuan Che, Zhibo Chen:
Sharp bounds on the size of pairable graphs and pairable bipartite graphs. Australas. J Comb. 62: 172-183 (2015) - 2013
- [j7]Zhongyuan Che, Karen L. Collins:
The Distinguishing Chromatic Number of Kneser Graphs. Electron. J. Comb. 20(1): 23 (2013) - [j6]Zhongyuan Che, Zhibo Chen:
Forcing faces in plane bipartite graphs (II). Discret. Appl. Math. 161(1-2): 71-80 (2013) - 2010
- [j5]Zhongyuan Che, Zhibo Chen:
On k-pairable regular graphs. Discret. Math. 310(23): 3334-3350 (2010)
2000 – 2009
- 2008
- [j4]Zhongyuan Che, Zhibo Chen:
Forcing faces in plane bipartite graphs. Discret. Math. 308(12): 2427-2439 (2008) - [j3]Zhongyuan Che:
Uniquely pairable graphs. Discret. Math. 308(24): 6104-6110 (2008) - [j2]Zhongyuan Che, Karen L. Collins, Claude Tardif:
Odd-angulated graphs and cancelling factors in box products. J. Graph Theory 58(3): 221-238 (2008) - 2007
- [j1]Zhongyuan Che, Karen L. Collins:
Retracts of box products with odd-angulated factors. J. Graph Theory 54(1): 24-40 (2007)
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-08-23 19:24 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:
