Zhiquan Hu

Orcid: 0000-0002-7121-5733

According to our database1, Zhiquan Hu authored at least 29 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Chvátal-Erdős type theorem for path-connectivity.
Discuss. Math. Graph Theory, 2024

The Erdős-Gyárfás conjecture holds for P10-free graphs.
Discret. Math., 2024

2023
<i>P</i><sub><i>k</i></sub>-factors in squares and line graphs of trees.
Appl. Math. Comput., December, 2023

Spanning trees with at most k leaves in 2-connected K1,r-free graphs.
Appl. Math. Comput., May, 2023

2022
OncoSplicing: an updated database for clinically relevant alternative splicing in 33 human cancers.
Nucleic Acids Res., 2022

2020
P<sub>3</sub>-Factors in the Square of a Tree.
Graphs Comb., 2020

Bipancyclicism and bipanconnectivity in bipartite graphs.
Appl. Math. Comput., 2020

A Novel Wireless Network Intrusion Detection Method Based on Adaptive Synthetic Sampling and an Improved Convolutional Neural Network.
IEEE Access, 2020

Influence of Introducing Artificial Intelligence on Autonomous Learning in Vocational Education.
Proceedings of the 2020 International Conference on Applications and Techniques in Cyber Intelligence, 2020

2018
Long cycles passing through ⌊4k+13⌋ vertices in <i>k</i>-connected graphs.
J. Graph Theory, 2018

2016
Every 3-connected {K<sub>1, 3</sub>, N<sub>1, 2, 3</sub>}-free graph is Hamilton-connected.
Graphs Comb., 2016

2015
Weakly bipancyclic bipartite graphs.
Discret. Appl. Math., 2015

2014
Degree Conditions for Spanning Brooms.
J. Graph Theory, 2014

2013
An Optimal Binding Number Condition for Bipancyclism.
SIAM J. Discret. Math., 2013

Two Forbidden Subgraph Pairs for Hamiltonicity of 3-Connected Graphs.
Graphs Comb., 2013

2012
Endpoint extendable paths in dense graphs.
Discret. Math., 2012

2011
Circumferences of <i>k</i>-connected graphs involving independence numbers.
J. Graph Theory, 2011

2009
A constructive characterization of total domination vertex critical graphs.
Discret. Math., 2009

Removable matchings and hamiltonian cycles.
Discret. Math., 2009

Weak cycle partition involving degree sum conditions.
Discret. Math., 2009

2008
Linked graphs with restricted lengths.
J. Comb. Theory B, 2008

Design of System Scheme and Operationmechanism on Agricultural Science &Technology Information Service System '110'.
Proceedings of the Computer and Computing Technologies in Agriculture II, Volume 3, 2008

2007
Partition of a graph into cycles and vertices.
Discret. Math., 2007

2005
Hamilton connectivity of line graphs and claw-free graphs.
J. Graph Theory, 2005

Perfect Circular Arc Coloring.
J. Comb. Optim., 2005

2002
Fan-type theorem for path-connectivity.
J. Graph Theory, 2002

2001
Long Cycles through a Linear Forest.
J. Comb. Theory B, 2001

1999
A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity.
Discret. Math., 1999

1998
A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem.
Discret. Appl. Math., 1998


  Loading...