default search action
Fan Wang 0007
Person information
- affiliation: Nanchang University, School of Sciences, China
- affiliation (former): Lanzhou University, School of Mathematics and Statistics, China
Other persons with the same name
- Fan Wang — disambiguation page
- Fan Wang 0001 — University of Arizona, Tucson, USA
- Fan Wang 0002 — INSA de Rouen, France
- Fan Wang 0003
— Sun-Yat Sen University, School of Business, Guangzhou, China (and 2 more)
- Fan Wang 0004 — Ohio State University, Department of Computer Science and Engineering, Columbus, OH, USA
- Fan Wang 0005
- Fan Wang 0006
- Fan Wang 0008
- Fan Wang 0009
- Fan Wang 0010
- Fan Wang 0011
- Fan Wang 0012
- Fan Wang 0013
- Fan Wang 0014
- Fan Wang 0015
- Fan Wang 0016
- Fan Wang 0017
- Fan Wang 0018
- Fan Wang 0019
- Fan Wang 0020
- Fan Wang 0021
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j14]Wuyang Sun
A Class of Cubic Graphs Satisfying Berge Conjecture. Graphs Comb. 38(3): 66 (2022)
2010 – 2019
- 2019
- [j13]Wuyang Sun, Fan Wang:
Perfect Matching Covers of Cubic Graphs of Oddness 2. Electron. J. Comb. 26(1): 1 (2019) - [j12]Fan Wang
Perfect matchings extend to two or more hamiltonian cycles in hypercubes. Discret. Math. 342(2): 505-510 (2019) - [j11]Huazhong Lü
Hamiltonian paths passing through prescribed edges in balanced hypercubes. Theor. Comput. Sci. 761: 23-33 (2019) - [j10]Fan Wang
One-to-one disjoint path covers in hypercubes with faulty edges. J. Supercomput. 75(8): 5583-5595 (2019) - 2018
- [j9]Fan Wang, Heping Zhang
Hamiltonian laceability in hypercubes with faulty edges. Discret. Appl. Math. 236: 438-445 (2018) - [j8]Fan Wang, Weisheng Zhao:
Matchings extend to Hamiltonian cycles in 5-cube. Discuss. Math. Graph Theory 38(1): 217-231 (2018) - [j7]Weisheng Zhao, Fan Wang, Heping Zhang
Construction for trees with unique minimum dominating sets. Int. J. Comput. Math. Comput. Syst. Theory 3(3): 204-213 (2018) - [j6]Fan Wang
A type of perfect matchings extend to hamiltonian cycles in k-ary n-cubes. Theor. Comput. Sci. 731: 28-35 (2018) - 2017
- [j5]Weisheng Zhao, Fan Wang, Xiaolu Gao, Hao Li:
Bondage number of the strong product of two trees. Discret. Appl. Math. 230: 133-145 (2017) - 2016
- [j4]Fan Wang, Heping Zhang
Small Matchings Extend to Hamiltonian Cycles in Hypercubes. Graphs Comb. 32(1): 363-376 (2016) - 2015
- [j3]Fan Wang, Heping Zhang:
Two types of matchings extend to Hamiltonian cycles in hypercubes. Ars Comb. 118: 269-283 (2015) - [j2]Fan Wang, Heping Zhang
Matchings extend to Hamiltonian cycles in k-ary n-cubes. Inf. Sci. 305: 1-13 (2015) - 2014
- [j1]Fan Wang
Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges. Discret. Math. 321: 35-44 (2014)
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 2025-02-15 00:20 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: