# Junqing Cai

According to our database

Collaborative distances:

^{1}, Junqing Cai authored at least 20 papers between 2011 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Spanning trees with at most 4 leaves in K1, 5-free graphs.

Discrete Mathematics, 2019

2018

Degree sum conditions on two disjoint cycles in graphs.

Inf. Process. Lett., 2018

An implicit degree condition for

*k*-connected 2-heavy graphs to be hamiltonian.
Inf. Process. Lett., 2018

Fan-type condition on disjoint cycles in a graph.

Discrete Mathematics, 2018

Dominating set and hamiltonicity in claw-heavy graphs.

Ars Comb., 2018

2017

Longest cycles in 4-connected graphs.

Discrete Mathematics, 2017

Implicit degree sum condition for long cycles.

Ars Comb., 2017

2016

Fan-type implicit-heavy subgraphs for hamiltonicity of implicit claw-heavy graphs.

Inf. Process. Lett., 2016

Hamilton Cycles in Implicit 2-Heavy Graphs.

Graphs and Combinatorics, 2016

Forbidden subgraph conditions for Hamilton cycles in implicit claw-heavy graphs.

Ars Comb., 2016

2015

A sufficient condition involving implicit degree and neighborhood intersection for long cycles.

Inf. Process. Lett., 2015

An algorithm for hamiltonian cycles under implicit degree conditions.

Ars Comb., 2015

2014

An implicit weighted degree condition for heavy cycles.

Discussiones Mathematicae Graph Theory, 2014

A new sufficient condition for pancyclability of graphs.

Discrete Applied Mathematics, 2014

An implicit σ3 type condition for heavy cycles in weighted graphs.

Ars Comb., 2014

2013

An Implicit Degree Condition for Pancyclicity of Graphs.

Graphs and Combinatorics, 2013

An implicit degree condition for hamiltonian cycles.

Ars Comb., 2013

2012

An implicit degree condition for hamiltonian graphs.

Discrete Mathematics, 2012

An implicit degree Dirac condition for hamiltonian cycles.

Ars Comb., 2012

2011

An Implicit Degree Condition for Cyclability in Graphs.

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011