D. Bauer, H. J. Broersma, H. J. Veldman, and R. Li, A Generalization of A Result of Haggkvist and Nicoghossian, Journal of Combinatorial Theory (Series B) 2(1989), 237-243.

R. Li, A. Saito and R. H. Schelp, Relative Length of Longest Paths and Cycles in 3-Connected Graphs, Journal of Graph Theory 37(2001), 137-157.

R. Li, A New Sufficient Condition for Hamiltonicity of Graphs, Information Processing Letters 98(2006), 159-161.

R. Li, A Space Efficient Algorithm for the Constrained Heaviest Common Subsequence Problem, Proceedings of the 46th ACM Southeast Conference (2008) 226-230, Auburn, AL, March 28-March 29, 2008.

R. Li, A Fan-Type Condition for Claw-Free Graphs to Be Hamiltonian, Discrete Mathematics 219(2000), 195-205.

R. Li and R. H. Schelp, Some Hamiltonian Properties of L1-Graphs, Discrete Mathematics 223(2000), 207-216.

R. Li and R. H. Schelp, Hamiltonicity of {K(1, 4), K(1, 4) + e}-Free Graphs, Discrete Mathematics 245(2002), 195-202.

R. Li, Hamiltonicity of 3-Connected Quasi-Claw-Free Graphs, Discrete Mathematics 265(2003), 393-399.

R. Li and R. H. Schelp, Every 3-Connected Distance Claw-Free Graph is Hamilton-Connected, Discrete Mathematics 268 (2003), 185-197.

R. Li, Hamiltonicity of 2-Connected Quasi-Claw-Free graphs, Discrete Mathematics 283(2004) 145-150.

R. Li, Hamiltonicity of 2-connected {K(1, 4), K(1, 4) + e}-Free Graphs, Discrete Mathematics 287(2004), 69-76.

R. Li, Hamiltonian Paths in Connected Claw-Free Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 25(1997), 113-119.

R. Li, A Note on 1-Tough Hamiltonian Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 26(1998), 129-130.

R. Li, Traceability in Claw-Free Graphs Through Induced Bulls, Journal of Combinatorial Mathematics and Combinatorial Computing 32(2000), 193-201.

R. Li, A Hamiltonian Result on L1-Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 40(2002), 79-95.

R. Li, Degree Sum Conditions for the Hamiltonicity and Traceability of L1-Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 45(2003), 33-41.

R. Li, A Note on Hamiltonian Cycles in K(1, r)-Free Graphs, Ars Combinatoria 51(1999), 199-203.

R. Li, Cycles Containing Prescribed Vertices, Utilitas Mathematica 55(1999), 73-78.

R. Li, A Linear Space Algorithm for the Heaviest Common Subsequence Problem, Utilitas Mathematica 75(2008), 13-20.

R. Li, Two Results on Hamiltonicity of K(1, r)-Free Graphs, Congressus Numerantium 120(1996), 183-187.

R. Li, A Local Ore-Type Condition for Graphs of Diameter Two to Be Traceable, Congressus Numerantium 122(1996), 125-128.

R. Li, Dominating Sets and Some Hamiltonian Properties of Claw-Free Graphs, Congressus Numerantium 155 (2002), 123-130.

R. Li and Y. Li, On Finding Hamiltonian Cycles or Paths in Certain Graphs and Related NP-Complete Problems, Congressus Numerantium 162 (2003), 173-182.

R. Li, On the Applications of A Theorem of Jung, Congressus Numerantium 167 (2004), 27-31.

R. Li, Asteroidal Numbers and Hamiltonicity of L1-Graphs, Congressus Numerantium 169 (2004), 155-159.

R. Li, Every 2-Connected Chordal Quasi-Claw-Free Graph Is Pancyclic, Congressus Numerantium 170 (2004), 203-204.

R. Li, R. Shick, and D. Smiley, An Algorithm for the Constrained Heaviest Common Subsequence Problem, Congressus Numerantium 174 (2005), 123-128.

R. Li, Graphs Having Equal Domination and Independent Domination Numbers, Congressus Numerantium 176 (2005), 65-68.

R. Li, Finding Hamiltonian Cycles in Four Subfamilies of Quasi-Claw-Free Graphs, accepted.

R. Li, The k - Domination Number and Bounds for the Laplacian Eigenvalues of Graphs, accepted.

R. Li, An Inequality on Laplacian Eigenvalues of Connected Graphs, accepted.