 | 2008 |
|---|
| 10 |       | Rao Li:
A space efficient algorithm for the constrained heaviest common subsequence problem.
ACM Southeast Regional Conference 2008: 226-230 |
| 2006 |
|---|
| 9 | | Rao Li:
A new sufficient condition for Hamiltonicity of graphs.
Inf. Process. Lett. 98(4): 159-161 (2006) |
| 2004 |
|---|
| 8 | | Rao Li:
Hamiltonicity of 2-connected quasi-claw-free graphs.
Discrete Mathematics 283(1-3): 145-150 (2004) |
| 7 | | Rao Li:
Hamiltonicity of 2-connected K1, 4, K1, 4+e-free graphs.
Discrete Mathematics 287(1-3): 69-76 (2004) |
| 2003 |
|---|
| 6 | | Rao Li:
Hamiltonicity of 3-connected quasi-claw-free graphs.
Discrete Mathematics 265(1-3): 393-399 (2003) |
| 5 | | Rao Li,
Richard H. Schelp:
Every 3-connected distance claw-free graph is Hamilton-connected.
Discrete Mathematics 268(1-3): 185-197 (2003) |
| 2002 |
|---|
| 4 | | Rao Li,
Richard H. Schelp:
Hamiltonicity of {K1, 4, K1, 4+e}-free graphs.
Discrete Mathematics 245(1-3): 195-202 (2002) |
| 2000 |
|---|
| 3 | | Rao Li:
A Fan-type condition for claw-free graphs to be Hamiltonian.
Discrete Mathematics 219(1-3): 195-205 (2000) |
| 2 | | Rao Li,
Richard H. Schelp:
Some hamiltonian properties of L1-graphs.
Discrete Mathematics 223(1-3): 207-216 (2000) |
| 1999 |
|---|
| 1 |  | Rao Li:
A Note on Hamiltonian Cycles in K(1, r)-Free Graphs.
Ars Comb. 51: (1999) |
