default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRao Li 0001
Person information
- affiliation: University of South Carolina at Aiken, Department of Mathematical Sciences, SC, USA
- affiliation: Georgia Southwestern State University, School of Computer and Information Sciences, Americus, GA, USA
- affiliation: University of Memphis, Department of Mathematical Sciences, TN, USA
Other persons with the same name
- Rao Li — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j19]Rao Li:
The matching number and Hamiltonicity of graphs. AKCE Int. J. Graphs Comb. 17(3): 1094-1095 (2020)
2010 – 2019
- 2016
- [j18]Rao Li:
Hamiltonicity of L1-Graphs with Bounded Dilworth Numbers. Ars Comb. 127: 57-64 (2016) - 2015
- [j17]Rao Li:
Harary index and some Hamiltonian properties of graphs. AKCE Int. J. Graphs Comb. 12(1): 64-69 (2015) - [j16]Rao Li:
On α - Incidence Energy and α - Distance Energy of a Graph. Ars Comb. 121: 373-384 (2015) - 2014
- [j15]Rao Li:
Two Results on the Hamiltonicity of L1-Graphs. Ars Comb. 115: 305-314 (2014) - 2012
- [j14]Rao Li:
An Inequality on Laplacian Eigenvalues of Connected Graphs. Ars Comb. 105: 361-368 (2012) - 2011
- [j13]Rao Li:
Hamilton-Connectivity of Claw-Free Graphs with Bounded Dilworth Numbers. Ars Comb. 98: 289-294 (2011)
2000 – 2009
- 2009
- [j12]Rao Li:
Finding Hamiltonian Cycles in Four Subfamilies of Quasi-Claw-Free Graphs. Ars Comb. 93 (2009) - [j11]Rao Li:
Finding Hamiltonian cycles in {quasi-claw, K1, 5, K1, 5+e}-free graphs with bounded Dilworth numbers. Discret. Math. 309(8): 2555-2558 (2009) - 2008
- [c1]Rao Li:
A space efficient algorithm for the constrained heaviest common subsequence problem. ACM Southeast Regional Conference 2008: 226-230 - 2006
- [j10]Rao Li:
A new sufficient condition for Hamiltonicity of graphs. Inf. Process. Lett. 98(4): 159-161 (2006) - 2004
- [j9]Rao Li:
Hamiltonicity of 2-connected quasi-claw-free graphs. Discret. Math. 283(1-3): 145-150 (2004) - [j8]Rao Li:
Hamiltonicity of 2-connected K1, 4, K1, 4+e-free graphs. Discret. Math. 287(1-3): 69-76 (2004) - 2003
- [j7]Rao Li:
Hamiltonicity of 3-connected quasi-claw-free graphs. Discret. Math. 265(1-3): 393-399 (2003) - [j6]Rao Li, Richard H. Schelp:
Every 3-connected distance claw-free graph is Hamilton-connected. Discret. Math. 268(1-3): 185-197 (2003) - 2002
- [j5]Rao Li, Richard H. Schelp:
Hamiltonicity of {K1, 4, K1, 4+e}-free graphs. Discret. Math. 245(1-3): 195-202 (2002) - 2001
- [j4]Rao Li, Akira Saito, Richard H. Schelp:
Relative length of longest paths and cycles in 3-connected graphs. J. Graph Theory 37(3): 137-156 (2001) - 2000
- [j3]Rao Li:
A Fan-type condition for claw-free graphs to be Hamiltonian. Discret. Math. 219(1-3): 195-205 (2000) - [j2]Rao Li, Richard H. Schelp:
Some hamiltonian properties of L1-graphs. Discret. Math. 223(1-3): 207-216 (2000)
1990 – 1999
- 1999
- [j1]Rao Li:
A Note on Hamiltonian Cycles in K(1, r)-Free Graphs. Ars Comb. 51 (1999)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-11 01:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
