# Zhiquan Hu

According to our database

Collaborative distances:

^{1}, Zhiquan Hu authored at least 20 papers between 1998 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Long cycles passing through ⌊4k+13⌋ vertices in

*k*-connected graphs.
Journal of Graph Theory, 2018

2016

Graphs and Combinatorics, 2016

2015

Weakly bipancyclic bipartite graphs.

Discrete Applied Mathematics, 2015

2014

Degree Conditions for Spanning Brooms.

Journal of Graph Theory, 2014

2013

An Optimal Binding Number Condition for Bipancyclism.

SIAM J. Discrete Math., 2013

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

Graphs and Combinatorics, 2013

2012

Endpoint extendable paths in dense graphs.

Discrete Mathematics, 2012

2011

Circumferences of

*k*-connected graphs involving independence numbers.
Journal of Graph Theory, 2011

2009

A constructive characterization of total domination vertex critical graphs.

Discrete Mathematics, 2009

Removable matchings and hamiltonian cycles.

Discrete Mathematics, 2009

Weak cycle partition involving degree sum conditions.

Discrete Mathematics, 2009

2008

Linked graphs with restricted lengths.

J. Comb. Theory, Ser. 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.

Discrete Mathematics, 2007

2005

Hamilton connectivity of line graphs and claw-free graphs.

Journal of Graph Theory, 2005

Perfect Circular Arc Coloring.

J. Comb. Optim., 2005

2002

Fan-type theorem for path-connectivity.

Journal of Graph Theory, 2002

2001

Long Cycles through a Linear Forest.

J. Comb. Theory, Ser. B, 2001

1999

A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity.

Discrete Mathematics, 1999

1998

A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem.

Discrete Applied Mathematics, 1998