default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYang Wu 0007
Person information
- affiliation: West Virginia University, Department of Mathematics, Morgantown, WV, USA
Other persons with the same name
- Yang Wu — disambiguation page
- Yang Wu 0001
![[0000-0001-8010-6857]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-8010-6857")
— Tencent AI Laboratory, Shenzhen, China (and 5 more) - Yang Wu 0002 — Beijing University of Posts and Telecommunications, State Key Laboratory of Information Photonics and Optical Communications, China
- Yang Wu 0003 — Traffic Management Research Institute of Ministry of Public Security of China, Wuxi, China (and 2 more)
- Yang Wu 0004 — University of Queensland, Institute for Molecular Bioscience, Brisbane, QLD, Australia (and 1 more)
- Yang Wu 0005 — Wuhan University of Technology, School of Resources and Environmental Engineering, China
- Yang Wu 0006 — Hangzhou Dianzi University, School of Computer Science and Technology, China
- Yang Wu 0008 — Grenoble Institute of Technology, France
- Yang Wu 0009 — Tsinghua University, Department of Electrical Engineering, Beijing, China
- Yang Wu 0010 — Harbin Institute of Technology, Research Center for Social Computing and Information Retrieval, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j11]Yue Yan, Lan Lei, Yang Wu, Hong-Jian Lai:
Squares of graphs are optimally (s,t)-supereulerian. Discret. Appl. Math. 359: 331-342 (2024)- 2023
- [j10]Wei Xiong, Fengxia Liu, Yang Wu, Mingquan Zhan, Hong-Jian Lai:
Complete family reduction and spanning connectivity in line graphs. Discret. Math. 346(1): 113210 (2023) - [j9]Bofeng Huo, Qingsong Du, Ping Li, Yang Wu, Jun Yin, Hong-Jian Lai:
Supereulerian regular matroids without small cocircuits. J. Graph Theory 102(1): 107-127 (2023) - 2022
- [j8]Lan Lei, Xiaoming Li, Yang Wu, Taoye Zhang, Hong-Jian Lai:
Strengthened Ore conditions for (s, t)-supereulerian graphs. Discret. Appl. Math. 320: 68-80 (2022) - [j7]Aimei Yu, Ping Li, Yang Wu, Hong-Jian Lai:
On the s-hamiltonianicity of an hourglass-free line graph. Discret. Math. 345(8): 112897 (2022) - 2021
- [j6]Xiaoling Ma, Yang Wu, Mingquan Zhan, Hong-Jian Lai:
On s-hamiltonicity of net-free line graphs. Discret. Math. 344(1): 112173 (2021) - 2020
- [j5]Muhuo Liu, Yang Wu, Hong-Jian Lai:
Unified Spectral Hamiltonian Results of Balanced Bipartite Graphs and Complementary Graphs. Graphs Comb. 36(5): 1363-1390 (2020) - 2019
- [j4]Ruifang Liu, Hong-Jian Lai, Yingzhi Tian, Yang Wu:
Vertex-connectivity and eigenvalues of graphs with fixed girth. Appl. Math. Comput. 344-345: 141-149 (2019) - [j3]Ping Li, Lan Wang, Yang Wu, Hong-Jian Lai:
Characterizations of matroids with an element lying in a restricted number of circuits. J. Comb. Optim. 38(3): 887-910 (2019) - 2017
- [j2]Hao Li, Hong-Jian Lai, Yang Wu, Shuzhen Zhu:
Panconnected index of graphs. Discret. Math. 340(5): 1092-1097 (2017) - [j1]Wei Xiong, Jinquan Xu, Zhengke Miao, Yang Wu, Hong-Jian Lai:
Supereulerian width of dense graphs. Discret. Math. 340(12): 2995-3001 (2017)
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-14 22:05 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:
