default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXingchao Deng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Chenxu Yang
, Ralf Klasing, Yaping Mao, Xingchao Deng:
On the distance-edge-monitoring numbers of graphs. Discret. Appl. Math. 342: 153-167 (2024)- [j10]Chenxu Yang, Xingchao Deng, Zhen Ji, Wen Li:
Distance-edge-monitoring numbers of some related pseudo wheel networks. Int. J. Parallel Emergent Distributed Syst. 39(3): 362-378 (2024) - 2023
- [j9]Xinge Feng, Xingchao Deng:
Toughness and binding number bounds of star-like and path factor. RAIRO Oper. Res. 57(3): 1167-1177 (2023) - 2022
- [i1]Chengxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng:
On the distance-edge-monitoring numbers of graphs. CoRR abs/2211.04920 (2022) - 2020
- [j8]Xingchao Deng, Qingye Yao, Yanbing Zhang, Xudong Cui:
A note on a conjecture of star chromatic index for outerplanar graphs. Appl. Math. Comput. 384: 125353 (2020)
2010 – 2019
- 2019
- [j7]Xingchao Deng, Zhiwei Shao, Huan Zhang, Weihua Yang:
The (d, 1)-total labelling of Sierpin'ski-like graphs. Appl. Math. Comput. 361: 484-492 (2019) - 2017
- [j6]Weihua Yang, Wei-Hua He, Hao Li, Xingchao Deng:
Supereulerian graphs and Chvatal-Erdos type conditions. Ars Comb. 132: 183-192 (2017) - 2016
- [j5]Xingchao Deng, Hengzhe Li, Guiying Yan:
Algorithm on rainbow connection for maximal outerplanar graphs. Theor. Comput. Sci. 651: 76-86 (2016) - 2014
- [j4]Shipeng Wang, Baoyindureng Wu, Xinhui An, Xiaoping Liu, Xingchao Deng:
Outer-connected domination in 2-connected cubic graphs. Discret. Math. Algorithms Appl. 6(3) (2014) - 2013
- [j3]Xingchao Deng, Jixiang Meng:
The Diameters of Almost All Bi-Cayley Graphs. Ars Comb. 111: 65-74 (2013) - [j2]Baoyindureng Wu, Xingchao Deng, Xinhui An, Guiying Yan:
A Note on Semi-coloring of Graphs. Graphs Comb. 29(4): 1135-1140 (2013) - 2012
- [j1]Xingchao Deng, Kai-Nan Xiang, Baoyindureng Wu:
Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs. Appl. Math. Lett. 25(3): 237-244 (2012)
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-05 20:20 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:
