Hao Li

  • Université de Paris-Sud, Laboratoire de Recherche en Informatique, France
  • Lanzhou University, School of Mathematics and Statistics, China

According to our database1, Hao Li authored at least 89 papers between 1991 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Maximum properly colored trees in edge-colored graphs.
J. Comb. Optim., 2022

Integer colorings with no rainbow k-term arithmetic progression.
Eur. J. Comb., 2022

The generalized measure of edge fault tolerance in exchanged crossed cube.
Theor. Comput. Sci., 2021

Vertex-disjoint stars in K1, r-free graphs.
Discret. Appl. Math., 2021

Vertex-disjoint rainbow triangles in edge-colored graphs.
Discret. Math., 2020

Locating any two vertices on Hamiltonian cycles in large graphs.
Discret. Math., 2020

Decompositions of graphs into cycles with chords.
J. Comb. Theory B, 2018

An implicit degree condition for <i>k</i>-connected 2-heavy graphs to be hamiltonian.
Inf. Process. Lett., 2018

The isolated-pentagon rule and nice substructures in fullerenes.
Ars Math. Contemp., 2018

A note on neighbor expanded sum distinguishing index.
Discuss. Math. Graph Theory, 2017

Longest cycles in 4-connected graphs.
Discret. Math., 2017

Bondage number of the strong product of two trees.
Discret. Appl. Math., 2017

On the minimum Kirchhoff index of graphs with a given vertex k-partiteness and edge k-partiteness.
Appl. Math. Comput., 2017

A Note on Edge-Disjoint Hamilton Cycles in Line Graphs.
Graphs Comb., 2016

Hamilton Cycles in Implicit 2-Heavy Graphs.
Graphs Comb., 2016

Universal arcs in tournaments.
Discret. Math., 2016

Hamiltonian cycles in spanning subgraphs of line graphs.
Discret. Appl. Math., 2016

Vertex-distinguishing proper arc colorings of digraphs.
Discret. Appl. Math., 2016

Locating sets of vertices on Hamiltonian cycles.
Discret. Appl. Math., 2016

Vertex-disjoint cycles in bipartite tournaments.
Discret. Math., 2015

Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model.
J. Appl. Math., 2014

An implicit weighted degree condition for heavy cycles.
Discuss. Math. Graph Theory, 2014

Complementary cycles in regular bipartite tournaments.
Discret. Math., 2014

A new sufficient condition for pancyclability of graphs.
Discret. Appl. Math., 2014

Data forwarding of realtime mobile target tracking in wireless sensor networks.
J. Ambient Intell. Humaniz. Comput., 2013

An Implicit Degree Condition for Pancyclicity of Graphs.
Graphs Comb., 2013

Generalizations of Dirac's theorem in Hamiltonian graph theory - A survey.
Discret. Math., 2013

Rainbow C<sub>3</sub>'s and c<sub>4</sub>'s in edge-colored graphs.
Discret. Math., 2013

An implicit degree condition for hamiltonian cycles.
Ars Comb., 2013

A Note on Heterochromatic C 4 in Edge-Colored Triangle-Free Graphs.
Graphs Comb., 2012

Color degree and heterochromatic cycles in edge-colored graphs.
Eur. J. Comb., 2012

An implicit degree condition for hamiltonian graphs.
Discret. Math., 2012

Locating pairs of vertices on Hamiltonian cycles.
Discret. Math., 2012

The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs.
Comb. Probab. Comput., 2012

An Implicit Degree Condition for Cyclability in Graphs.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

Algorithm for two disjoint long paths in 2-connected graphs.
Theor. Comput. Sci., 2010

The k-dominating cycles in graphs.
Eur. J. Comb., 2010

Cyclability in k-connected K<sub>1, 4</sub>-free graphs.
Discret. Math., 2010

A note on graphs containing all trees of a given size.
Ars Comb., 2010

Color degree and alternating cycles in edge-colored graphs.
Discret. Math., 2009

A sufficient condition for pancyclability of graphs.
Discret. Math., 2009

Hamiltonicity and pancyclicity of cartesian products of graphs.
Discret. Math., 2009

The heterochromatic matchings in edge-colored bipartite graphs.
Ars Comb., 2009

Neighborhood unions and extremal spanning trees.
Discret. Math., 2008

Heterochromatic Matchings in Edge-Colored Graphs.
Electron. J. Comb., 2008

A Note on <i>k</i> -walks in Bridgeless Graphs.
Graphs Comb., 2007

A sufficient condition for cyclability in directed graphs.
Discret. Math., 2007

A Chvátal-Erdos type condition for pancyclability.
Discret. Math., 2007

A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs.
Discret. Math., 2007

Long Alternating Cycles in Edge-Colored Complete Graphs.
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

Hamiltonicity and pancyclicity of generalized prisms.
Electron. Notes Discret. Math., 2006

Chvátal-Erdös condition and pancyclism.
Discuss. Math. Graph Theory, 2006

A Note on a Generalisation of Ore's Condition.
Graphs Comb., 2005

The partition of a strong tournament.
Discret. Math., 2005

Balanced edge colorings.
J. Comb. Theory B, 2004

A note on pancyclism of highly connected graphs.
Discret. Math., 2004

Partition of a graph into cycles and degenerated cycles.
Discret. Math., 2004

Cycles through given vertices and closures.
Discret. Math., 2004

Partitioning a strong tournament into k cycles.
Ars Comb., 2004

Two-factors each component of which contains a specified vertex.
J. Graph Theory, 2003

Partitioning vertices of 1-tough graphs into paths.
Theor. Comput. Sci., 2001

Partitioning Vertices of a Tournament into Independent Cycles.
J. Comb. Theory B, 2001

A note on a new condition implying pancyclism.
Discuss. Math. Graph Theory, 2001

Clique covering and degree conditions for hamiltonicity in claw-free graphs.
Discret. Math., 2001

On quasifactorability in graphs.
Discret. Math., 2001

A note on the vertex-distinguishing proper coloring of graphs with large minimum degree.
Discret. Math., 2001

Cyclability of 3-connected graphs.
J. Graph Theory, 2000

On the Loebl-Komlós-Sós conjecture.
J. Graph Theory, 2000

On the Vertex-Distinguishing Proper Edge-Colorings of Graphs.
J. Comb. Theory B, 1999

Distance-Dominating Cycles in Quasi Claw-Free Graphs.
Graphs Comb., 1999

(2, k)-Factor-Critical Graphs and Toughness.
Graphs Comb., 1999

An Ore-type condition for pancyclability.
Discret. Math., 1999

On 2-factors in claw-free graphs.
Discret. Math., 1999

Hamiltonicity in 2-connected graphs with claws.
Discret. Math., 1998

Global insertion and hamiltonicity in DCT-graphs.
Discret. Math., 1998

Hamiltonicity of 2-connected claw-center independent graphs.
Discret. Math., 1997

Cycles through subsets with large degree sums.
Discret. Math., 1997

Dlambda-cycles in lambda-claw-free graphs.
Discret. Math., 1997

Sequences, claws and cyclability of graphs.
J. Graph Theory, 1996

Pancyclism and small cycles in graphs.
Discuss. Math. Graph Theory, 1996

Strong edge colorings of graphs.
Discret. Math., 1996

Shortest walks in almost claw-free graphs.
Ars Comb., 1996

Dominating cycles in bipartite biclaw-free graphs.
Discret. Math., 1995

Mengerian properties, hamiltonicity, and claw-free graphs.
Networks, 1994

Hamiltonicity of Bipartite Biclaw-free Graphs.
Discret. Appl. Math., 1994

The complete closure of a graph.
J. Graph Theory, 1993

On hamiltonian claw-free graphs.
Discret. Math., 1993

Hamiltonism, degree sum and neighborhood intersections.
Discret. Math., 1991

The product of the independent domination numbers of a graph and its complement.
Discret. Math., 1991