Rao Li A Note on Hamiltonian Cycles in K(1, r)-Free Graphs. [Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:51, n:, pp:- [Journal]

Rao Li A Fan-type condition for claw-free graphs to be Hamiltonian. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:219, n:1-3, pp:195-205 [Journal]

Rao Li Hamiltonicity of 3-connected quasi-claw-free graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:265, n:1-3, pp:393-399 [Journal]

Rao Li Hamiltonicity of 2-connected quasi-claw-free graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:283, n:1-3, pp:145-150 [Journal]

Rao Li A new sufficient condition for Hamiltonicity of graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:98, n:4, pp:159-161 [Journal]

A space efficient algorithm for the constrained heaviest common subsequence problem. [Citation Graph (, )][DBLP]

Finding Hamiltonian cycles in {quasi-claw, K_{1, 5}, K_{1, 5}+e}-free graphs with bounded Dilworth numbers. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.002secs

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP