default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhiquan Hu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Zhiquan Hu, Changlong Shen
:
The Erdős-Gyárfás conjecture holds for P10-free graphs. Discret. Math. 347(12): 114175 (2024)- [j26]Guantao Chen, Zhiquan Hu, Yaping Wu:
A Chvátal-Erdős type theorem for path-connectivity. Discuss. Math. Graph Theory 44(4): 1247-1260 (2024) - 2023
- [j25]Guantao Chen, Yuan Chen, Zhiquan Hu, Shunzhe Zhang:
Spanning trees with at most k leaves in 2-connected K1,r-free graphs. Appl. Math. Comput. 445: 127842 (2023) - [j24]Yuan Chen, Guowei Dai, Zhiquan Hu:
Pk-factors in squares and line graphs of trees. Appl. Math. Comput. 458: 128244 (2023) - 2022
- [j23]Yangjun Zhang, Xiangyang Yao, Hui Zhou, Xiaoliang Wu, Jianbo Tian, Jin Zeng, Libin Yan, Chen Duan, Haoran Liu, Heng Li, Ke Chen, Zhiquan Hu, Zhangqun Ye, Hua Xu:
OncoSplicing: an updated database for clinically relevant alternative splicing in 33 human cancers. Nucleic Acids Res. 50(D1): 1340-1347 (2022) - 2020
- [j22]Zhiquan Hu, Liejun Wang, Lei Qi, Yongming Li, Wenzhong Yang:
A Novel Wireless Network Intrusion Detection Method Based on Adaptive Synthetic Sampling and an Improved Convolutional Neural Network. IEEE Access 8: 195741-195751 (2020) - [j21]Zhiquan Hu, Yan Zou:
Bipancyclicism and bipanconnectivity in bipartite graphs. Appl. Math. Comput. 377: 125149 (2020) - [j20]Guowei Dai, Zhiquan Hu:
P3-Factors in the Square of a Tree. Graphs Comb. 36(6): 1913-1925 (2020) - [c2]Zhiquan Hu:
Influence of Introducing Artificial Intelligence on Autonomous Learning in Vocational Education. ATCI 2020: 361-366
2010 – 2019
- 2018
- [j19]Zhiquan Hu, Feifei Song:
Long cycles passing through ⌊4k+13⌋ vertices in k-connected graphs. J. Graph Theory 87(3): 374-393 (2018) - 2016
- [j18]Zhiquan Hu, Shunzhe Zhang:
Every 3-connected {K1, 3, N1, 2, 3}-free graph is Hamilton-connected. Graphs Comb. 32(2): 685-705 (2016) - 2015
- [j17]Zhiquan Hu, Jing Sun:
Weakly bipancyclic bipartite graphs. Discret. Appl. Math. 194: 102-120 (2015) - 2014
- [j16]Guantao Chen, Michael Ferrara, Zhiquan Hu, Michael S. Jacobson, Huiqing Liu:
Degree Conditions for Spanning Brooms. J. Graph Theory 77(3): 237-250 (2014) - 2013
- [j15]Zhiquan Hu, Houyuan Lin:
Two Forbidden Subgraph Pairs for Hamiltonicity of 3-Connected Graphs. Graphs Comb. 29(6): 1755-1775 (2013) - [j14]Zhiquan Hu, Ka Ho Law, Wenan Zang:
An Optimal Binding Number Condition for Bipancyclism. SIAM J. Discret. Math. 27(2): 597-618 (2013) - 2012
- [j13]Guantao Chen, Zhiquan Hu, Hao Li:
Endpoint extendable paths in dense graphs. Discret. Math. 312(17): 2584-2592 (2012) - 2011
- [j12]Guantao Chen, Zhiquan Hu, Yaping Wu:
Circumferences of k-connected graphs involving independence numbers. J. Graph Theory 68(1): 55-76 (2011)
2000 – 2009
- 2009
- [j11]Zhiquan Hu, Hao Li:
Weak cycle partition involving degree sum conditions. Discret. Math. 309(4): 647-654 (2009) - [j10]Chunxiang Wang, Zhiquan Hu, Xiangwen Li:
A constructive characterization of total domination vertex critical graphs. Discret. Math. 309(4): 991-996 (2009) - [j9]Zhiquan Hu, Hao Li:
Removable matchings and hamiltonian cycles. Discret. Math. 309(5): 1020-1024 (2009) - 2008
- [j8]Guantao Chen, Yuan Chen, Shuhong Gao, Zhiquan Hu:
Linked graphs with restricted lengths. J. Comb. Theory B 98(4): 735-751 (2008) - [c1]Yongchang Wu, Zhiquan Hu, Bilin Xiao, Quanxin Li:
Design of System Scheme and Operationmechanism on Agricultural Science &Technology Information Service System '110'. CCTA (3) 2008: 1939-1947 - 2007
- [j7]Zhiquan Hu, Hao Li:
Partition of a graph into cycles and vertices. Discret. Math. 307(11-12): 1436-1440 (2007) - 2005
- [j6]Xujin Chen, Zhiquan Hu, Wenan Zang:
Perfect Circular Arc Coloring. J. Comb. Optim. 9(3): 267-280 (2005) - [j5]Zhiquan Hu, Feng Tian, Bing Wei:
Hamilton connectivity of line graphs and claw-free graphs. J. Graph Theory 50(2): 130-141 (2005) - 2002
- [j4]Zhiquan Hu, Feng Tian, Bing Wei, Yoshimi Egawa, Kazuhide Hirohata:
Fan-type theorem for path-connectivity. J. Graph Theory 39(4): 265-282 (2002) - 2001
- [j3]Zhiquan Hu, Feng Tian, Bing Wei:
Long Cycles through a Linear Forest. J. Comb. Theory B 82(1): 67-80 (2001)
1990 – 1999
- 1999
- [j2]Zhiquan Hu:
A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity. Discret. Math. 196(1-3): 167-175 (1999) - 1998
- [j1]Zhiquan Hu, Zhenhong Liu:
A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem. Discret. Appl. Math. 82(1-3): 135-154 (1998)
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-08-27 21:59 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:
