We stand with Ukraine

We stand with Ukraine

Rao Li

Affiliations:

University of South Carolina at Aiken, Department of Mathematical Sciences, SC, USA
Georgia Southwestern State University, School of Computer and Information Sciences, Americus, GA, USA
University of Memphis, Department of Mathematical Sciences, TN, USA

According to our database¹, Rao Li authored at least 20 papers between 1999 and 2020.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2020

The matching number and Hamiltonicity of graphs.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2020

2016

Hamiltonicity of L<sub>1</sub>-Graphs with Bounded Dilworth Numbers.

[BibT_eX]

Ars Comb., 2016

2015

On α - Incidence Energy and α - Distance Energy of a Graph.

[BibT_eX]

Ars Comb., 2015

Harary index and some Hamiltonian properties of graphs.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2015

2014

Two Results on the Hamiltonicity of L<sub>1</sub>-Graphs.

[BibT_eX]

Ars Comb., 2014

2012

An Inequality on Laplacian Eigenvalues of Connected Graphs.

[BibT_eX]

Ars Comb., 2012

2011

Hamilton-Connectivity of Claw-Free Graphs with Bounded Dilworth Numbers.

[BibT_eX]

Ars Comb., 2011

2009

Finding Hamiltonian cycles in {quasi-claw, K<sub>1, 5</sub>, K<sub>1, 5</sub>+e}-free graphs with bounded Dilworth numbers.

[BibT_eX]

[DOI]

Discret. Math., 2009

Finding Hamiltonian Cycles in Four Subfamilies of Quasi-Claw-Free Graphs.

[BibT_eX]

Ars Comb., 2009

2008

A space efficient algorithm for the constrained heaviest common subsequence problem.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Southeast Regional Conference, 2008

2006

A new sufficient condition for Hamiltonicity of graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

2004

Hamiltonicity of 2-connected <i>K</i><sub>1, 4</sub>, <i>K</i><sub>1, 4+<i>e</i></sub>-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

Hamiltonicity of 2-connected quasi-claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

Every 3-connected distance claw-free graph is Hamilton-connected.

[BibT_eX]

[DOI]

,

Richard H. Schelp

Discret. Math., 2003

Hamiltonicity of 3-connected quasi-claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

Hamiltonicity of {K<sub>1, 4</sub>, K<sub>1, 4</sub>+<i>e</i>}-free graphs.

[BibT_eX]

[DOI]

,

Richard H. Schelp

Discret. Math., 2002

2001

Relative length of longest paths and cycles in 3-connected graphs.

[BibT_eX]

[DOI]

,

,

Richard H. Schelp

J. Graph Theory, 2001

2000

Some hamiltonian properties of <i>L</i><sub>1</sub>-graphs.

[BibT_eX]

[DOI]

,

Richard H. Schelp

Discret. Math., 2000

A Fan-type condition for claw-free graphs to be Hamiltonian.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

A Note on Hamiltonian Cycles in K(1, r)-Free Graphs.

[BibT_eX]

Ars Comb., 1999

Loading...