default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuangjun Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Zuosong Liang, Guangjun Xu, Chunsong Bai:
A note on the Three Color Problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles. Discret. Math. 346(1): 113192 (2023)- 2022
- [j17]Huabing Xu
, Yucai Shan, Guangjun Xu:
Performance of SMAP and SMOS Salinity Products under Tropical Cyclones in the Bay of Bengal. Remote. Sens. 14(15): 3733 (2022) - 2021
- [j16]Jun He, Yanmin Liu, Guangjun Xu:
New S-type inclusion theorems for the M-eigenvalues of a 4th-order partially symmetric tensor with applications. Appl. Math. Comput. 398: 125992 (2021) - [j15]Jun He, Yanmin Liu, Guangjun Xu:
An S-type inclusion set for C-eigenvalues of a piezoelectric-type tensor. Appl. Math. Lett. 121: 107448 (2021) - 2020
- [j14]Xiao Yang, Guangjun Xu, Yu Liu, Wenjin Sun, Changshui Xia, Changming Dong:
Multi-Source Data Analysis of Mesoscale Eddies and Their Effects on Surface Chlorophyll in the Bay of Bengal. Remote. Sens. 12(21): 3485 (2020)
2010 – 2019
- 2019
- [j13]Guangjun Xu, Cheng Cheng, Wenxian Yang, Wenhong Xie, Lingmei Kong, Renlong Hang, Furong Ma, Changming Dong, Jingsong Yang:
Oceanic Eddy Identification Using an AI Scheme. Remote. Sens. 11(11): 1349 (2019) - 2017
- [j12]Guangjun Xu, Sanming Zhou:
Hadwiger's Conjecture for the Complements of Kneser Graphs. J. Graph Theory 84(1): 5-16 (2017) - 2016
- [j11]David Wood, Guangjun Xu, Sanming Zhou:
Hadwiger's Conjecture for 3-Arc Graphs. Electron. J. Comb. 23(4): 4 (2016) - 2015
- [j10]Guangjun Xu, Sanming Zhou:
Three-arc graphs: Characterization and domination. Discret. Appl. Math. 193: 200-207 (2015) - 2014
- [j9]Guangjun Xu, Sanming Zhou:
Hamiltonicity of 3-Arc Graphs. Graphs Comb. 30(5): 1283-1299 (2014) - 2011
- [j8]Martin Knor, Guangjun Xu, Sanming Zhou:
A study of 3-arc graphs. Discret. Appl. Math. 159(5): 344-353 (2011) - [j7]Guangjun Xu, Liying Kang:
On the power domination number of the generalized Petersen graphs. J. Comb. Optim. 22(2): 282-291 (2011)
2000 – 2009
- 2009
- [j6]Guangjun Xu:
2-rainbow domination in generalized Petersen graphs P(n, 3). Discret. Appl. Math. 157(11): 2570-2573 (2009) - [j5]Hong Yan, Liying Kang, Guangjun Xu:
The exact domination number of the generalized Petersen graphs. Discret. Math. 309(8): 2596-2607 (2009) - 2008
- [j4]Guangjun Xu, Liying Kang, Erfang Shan, Hong Yan:
Proof of a conjecture on k-tuple domination in graphs. Appl. Math. Lett. 21(3): 287-290 (2008) - 2007
- [j3]Guangjun Xu, Erfang Shan, Liying Kang, T. C. Edwin Cheng:
The algorithmic complexity of the minus clique-transversal problem. Appl. Math. Comput. 189(2): 1410-1418 (2007) - 2006
- [j2]Guangjun Xu, Liying Kang, Erfang Shan:
Acyclic domination on bipartite permutation graphs. Inf. Process. Lett. 99(4): 139-144 (2006) - [j1]Guangjun Xu, Liying Kang, Erfang Shan, Min Zhao:
Power domination in block graphs. Theor. Comput. Sci. 359(1-3): 299-305 (2006)
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-05-08 21:01 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:
