default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBing Chen 0006
Person information
- affiliation: Xi'an University of Technology, Department of Applied Mathematics, Xi'an, China
- affiliation (former): Northwestern Polytechnical University, Department of Applied Mathematics, Xi'an, China
Other persons with the same name
- Bing Chen — disambiguation page
- Bing Chen 0001
![[0000-0002-0305-7411]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-0305-7411")
— Qingdao University, Institute of Complexity Science, China (and 3 more) - Bing Chen 0002 — Nanjing University of Aeronautics and Astronautics, College of Computer Science and Technology, China
- Bing Chen 0003 — Memorial University of Newfoundland, Faculty of Engineering and Applied Science, Saint John's, NL, Canada (and 1 more)
- Bing Chen 0004 — Sun Yat-sen University, School of Data and Computer Science, Guangzhou, China
- Bing Chen 0005 — Hefei University of Technology, School of Mechanical Engineering, Hefei, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j7]Yanni Dong, Shengning Qiao, Bing Chen, Pengfei Wan, Shenggui Zhang:
Maximum values of degree-based entropies of bipartite graphs. Appl. Math. Comput. 401: 126094 (2021)
2010 – 2019
- 2014
- [j6]Bo Ning, Shenggui Zhang, Bing Chen:
Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs. Discret. Math. Algorithms Appl. 6(3) (2014) - 2010
- [c4]Bing Chen, Shenggui Zhang:
Computing the Scattering Number of Bicyclic Graphs. CIS 2010: 497-500
2000 – 2009
- 2009
- [j5]Bing Chen, Shenggui Zhang, Shengning Qiao:
Hamilton cycles in claw-heavy graphs. Discret. Math. 309(8): 2015-2019 (2009) - 2008
- [j4]Bing Chen, Shenggui Zhang:
A New s3 Type Condition for Heavy Cycles in Weighted Graphs. Ars Comb. 87 (2008) - [j3]Bing Chen, Shenggui Zhang, T. C. Edwin Cheng:
Heavy cycles in k-connected weighted graphs with large weighted degree sums. Discret. Math. 308(20): 4531-4543 (2008) - 2007
- [c3]Bing Chen, Shenggui Zhang, T. C. Edwin Cheng:
Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums. International Conference on Computational Science (3) 2007: 338-346 - 2006
- [j2]Bing Chen, Shenggui Zhang:
An implicit degree condition for long cycles in 2-connected graphs. Appl. Math. Lett. 19(11): 1148-1151 (2006) - 2005
- [c2]Bing Chen, Shenggui Zhang, T. C. Edwin Cheng:
An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs. CJCDGCGT 2005: 21-29 - 2004
- [j1]Shenggui Zhang, Bing Chen, Rongzu Yu:
Heavy cycles in k-connected weighted graphs. Electron. Notes Discret. Math. 17: 293-296 (2004) - [c1]Shenggui Zhang, Bing Chen, Rongzu Yu:
Heavy Cycles in k-connected Weighted Graphs. CTW 2004: 253-256
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-11-18 20:46 CET 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:
