default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiangen Chen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j14]Fang Yang, Xiangen Chen, Chunyan Ma:
On the vertex-distinguishing proper total colorings of complete p-partite graphs with equipotent parts. Ars Comb. 134: 233-249 (2017)- 2016
- [i1]Bing Yao, Ming Yao, Xiangen Chen:
Probing Graph Proper Total Colorings With Additional Constrained Conditions. CoRR abs/1601.00883 (2016) - 2015
- [j13]Jing Guo, Xiangen Chen, Zhiwen Wang, Bing Yao:
Total vertex irregularity strength of certain equitable complete m-partite graphs. Ars Comb. 123: 407-418 (2015) - [j12]Xiang'en Chen, Zepeng Li:
Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with Δ = 9, 10, or 11. Inf. Process. Lett. 115(2): 263-268 (2015) - [c3]Xiaomin Wang, Bing Yao, Fei Ma, Xiyang Zhao, Jing Su, Xiangen Chen, Ming Yao:
On composition and decomposition of networks. BMEI 2015: 783-788 - [c2]Xiaomin Wang, Bing Yao, Fei Ma, Jing Su, Xiangen Chen, Ming Yao:
Hierarchical structure and particular spanning trees of edge-bound growing network models. FSKD 2015: 444-449 - 2014
- [j11]Fang Yang, Xiang'en Chen, Chunyan Ma:
On the vertex-distinguishing proper edge coloring of composition of complete graph and star. Inf. Process. Lett. 114(4): 217-221 (2014) - [j10]Xiang'en Chen, Yuping Gao, Bing Yao:
Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph. Inf. Sci. 288: 246-253 (2014) - 2013
- [j9]Xiang'en Chen, Yuping Gao, Bing Yao:
Vertex-distinguishing IE-total colorings of complete bipartite graphs Km, n(m<n). Discuss. Math. Graph Theory 33(2): 289-306 (2013) - [j8]Xiang'en Chen, Yuping Gao, Bing Yao:
Not necessarily proper total colourings which are adjacent vertex distinguishing. Int. J. Comput. Math. 90(11): 2298-2307 (2013) - [j7]Xiangqian Zhou, Bing Yao, Xiangen Chen:
Every lobster is odd-elegant. Inf. Process. Lett. 113(1-2): 30-33 (2013) - [c1]Bing Yao, Xia Liu, Wan-Jia Zhang, Xiangen Chen, Xiao-Min Zhang, Ming Yao, Zheng-Xue Zhao:
Applying Graph theory to the Internet of Things. HPCC/EUC 2013: 2354-2361 - 2012
- [j6]Xiangqian Zhou, Bing Yao, Xiangen Chen, Haixia Tao:
A proof to the odd-gracefulness of all lobsters. Ars Comb. 103: 13-18 (2012) - [j5]Xiang'en Chen, Keyi Su, Bing Yao:
A Note on Chromatic Uniqueness of Certain Complete Tripartite Graphs. Ars Comb. 105: 205-211 (2012)
2000 – 2009
- 2008
- [j4]Hui Cheng, Bing Yao, Xiangen Chen, Zhongfu Zhang:
On Graceful Generalized Spiders and Caterpillars. Ars Comb. 87 (2008) - [j3]Zhongfu Zhang, Pengxiang Qiu, Baogen Xu, Jingwen Li, Xiangen Chen, Bing Yao:
Vertex-distinguishing total coloring of graphs. Ars Comb. 87 (2008) - [j2]Xiang'en Chen:
On the adjacent vertex distinguishing total coloring numbers of graphs with Delta=3. Discret. Math. 308(17): 4003-4007 (2008) - 2004
- [j1]Xiang'en Chen:
On the largest eigenvalues of trees. Discret. Math. 285(1-3): 47-55 (2004)
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-15 19:31 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:
