default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXinhui An
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j17]Miaomiao Zhuo, Qinqin Li, Baoyindureng Wu
, Xinhui An:
Average Edge-Connectivity of Cubic Graphs. J. Interconnect. Networks 21(4): 2142002:1-2142002:15 (2021)
2010 – 2019
- 2017
- [j16]Fangxia Wang, Baoyindureng Wu, Xinhui An:
A -decomposition of tournaments and bipartite digraphs. Discret. Appl. Math. 226: 158-165 (2017) - [j15]Wei Yang, Xinhui An, Baoyindureng Wu:
Paired-domination number of claw-free odd-regular graphs. J. Comb. Optim. 33(4): 1266-1275 (2017) - 2016
- [j14]Xiaoling Ma, Hong-Jian Lai, Wei Xiong, Baoyingdureng Wu, Xinhui An:
Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs. Discret. Appl. Math. 202: 111-130 (2016) - 2014
- [j13]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) - [j12]Baoyindureng Wu, Xinhui An:
Disproof of the group coloring version of the Hadwiger conjecture. Discret. Math. Algorithms Appl. 6(3) (2014) - 2013
- [j11]Baoyindureng Wu, Xingchao Deng, Xinhui An, Guiying Yan:
A Note on Semi-coloring of Graphs. Graphs Comb. 29(4): 1135-1140 (2013) - [j10]Baoyindureng Wu, Xinhui An, Guojie Liu, Guiying Yan, Xiaoping Liu:
Minimum degree, edge-connectivity and radius. J. Comb. Optim. 26(3): 585-591 (2013) - 2011
- [j9]Daobin Li, Baoyindureng Wu, Xunuan Yang, Xinhui An:
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts. Discret. Appl. Math. 159(15): 1594-1600 (2011) - [j8]Weijuan Zhang, Baoyindureng Wu, Xinhui An:
The Hyper-Wiener Index of the kth Power of a Graph. Discret. Math. Algorithms Appl. 3(1): 17-24 (2011) - [j7]Baoyindureng Wu, Guojie Liu, Xinhui An, Guiying Yan, Xiaoping Liu:
A Conjecture on Average Distance and Diameter of a Graph. Discret. Math. Algorithms Appl. 3(3): 337-342 (2011) - 2010
- [j6]Jianfeng Wang, Qiongxiang Huang, Xinhui An, Francesco Belardo:
Some results on the signless Laplacians of graphs. Appl. Math. Lett. 23(9): 1045-1049 (2010) - [j5]Xinhui An, Baoyindureng Wu:
HajóS-like Theorem for Group Coloring. Discret. Math. Algorithms Appl. 2(3): 433-436 (2010)
2000 – 2009
- 2009
- [j4]Xiaoping Liu, Xinhui An, Baoyindureng Wu:
On perfect matchings of complements of line graphs. Ars Comb. 90 (2009) - [j3]Xinhui An, Baoyindureng Wu:
List linear arboricity of planar graphs. Discuss. Math. Graph Theory 29(3): 499-510 (2009) - [c1]Baoyindureng Wu, Xinhui An:
A Note on Edge Choosability and Degeneracy of Planar Graphs. COCOA 2009: 249-257 - 2008
- [j2]Xinhui An, Baoyindureng Wu:
The Wiener index of the kth power of a graph. Appl. Math. Lett. 21(5): 436-440 (2008) - 2007
- [j1]Xinhui An, Baoyindureng Wu:
Hamiltonicity of complements of middle graphs. Discret. Math. 307(9-10): 1178-1184 (2007)
Coauthor Index
aka: Baoyingdureng Wu
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-04-25 05:56 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:
