The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rao Li: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. Rao Li
    Hamiltonicity of 2-connected K1, 4, K1, 4+e-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:69-76 [Journal]
  6. Rao Li, Richard H. Schelp
    Some hamiltonian properties of L1-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:223, n:1-3, pp:207-216 [Journal]
  7. Rao Li, Richard H. Schelp
    Hamiltonicity of {K1, 4, K1, 4+e}-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:195-202 [Journal]
  8. Rao Li, Richard H. Schelp
    Every 3-connected distance claw-free graph is Hamilton-connected. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:185-197 [Journal]
  9. 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]

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


  11. Finding Hamiltonian cycles in {quasi-claw, K1, 5, K1, 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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002