# Rao Li

According to our database

Collaborative distances:

^{1}, Rao Li authored at least 19 papers between 1999 and 2016.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2016

Hamiltonicity of L

_{1}-Graphs with Bounded Dilworth Numbers.
Ars Comb., 2016

2015

Spectral Invariants and Some Stable Properties of a Graph.

Ars Comb., 2015

On α - Incidence Energy and α - Distance Energy of a Graph.

Ars Comb., 2015

2014

Two Results on the Hamiltonicity of L

_{1}-Graphs.
Ars Comb., 2014

2012

An Inequality on Laplacian Eigenvalues of Connected Graphs.

Ars Comb., 2012

2011

Hamilton-Connectivity of Claw-Free Graphs with Bounded Dilworth Numbers.

Ars Comb., 2011

2009

Finding Hamiltonian cycles in {quasi-claw, K

_{1, 5}, K_{1, 5}+e}-free graphs with bounded Dilworth numbers.
Discrete Mathematics, 2009

Finding Hamiltonian Cycles in Four Subfamilies of Quasi-Claw-Free Graphs.

Ars Comb., 2009

2008

A space efficient algorithm for the constrained heaviest common subsequence problem.

Proceedings of the 46th Annual Southeast Regional Conference, 2008

2006

A new sufficient condition for Hamiltonicity of graphs.

Inf. Process. Lett., 2006

2004

Discrete Mathematics, 2004

Hamiltonicity of 2-connected quasi-claw-free graphs.

Discrete Mathematics, 2004

2003

Every 3-connected distance claw-free graph is Hamilton-connected.

Discrete Mathematics, 2003

Hamiltonicity of 3-connected quasi-claw-free graphs.

Discrete Mathematics, 2003

2002

Discrete Mathematics, 2002

2001

Relative length of longest paths and cycles in 3-connected graphs.

Journal of Graph Theory, 2001

2000

Discrete Mathematics, 2000

A Fan-type condition for claw-free graphs to be Hamiltonian.

Discrete Mathematics, 2000

1999

A Note on Hamiltonian Cycles in K(1, r)-Free Graphs.

Ars Comb., 1999