Hao Li

According to our database1, Hao Li authored at least 48 papers between 1991 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
A note on neighbor expanded sum distinguishing index.
Discussiones Mathematicae Graph Theory, 2017

2016
Locating sets of vertices on Hamiltonian cycles.
Discrete Applied Mathematics, 2016

2012
Locating pairs of vertices on Hamiltonian cycles.
Discrete Mathematics, 2012

The Maximum Number of Triangles in C2k+1-Free Graphs.
Combinatorics, Probability & Computing, 2012

2010
Cyclability in k-connected K1, 4-free graphs.
Discrete Mathematics, 2010

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

2009
A sufficient condition for pancyclability of graphs.
Discrete Mathematics, 2009

Hamiltonicity and pancyclicity of cartesian products of graphs.
Discrete Mathematics, 2009

2008
Neighborhood unions and extremal spanning trees.
Discrete Mathematics, 2008

2007
A Note on k -walks in Bridgeless Graphs.
Graphs and Combinatorics, 2007

A sufficient condition for cyclability in directed graphs.
Discrete Mathematics, 2007

A Chvátal-Erdos type condition for pancyclability.
Discrete Mathematics, 2007

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

2006
Hamiltonicity and pancyclicity of generalized prisms.
Electronic Notes in Discrete Mathematics, 2006

Chvátal-Erdös condition and pancyclism.
Discussiones Mathematicae Graph Theory, 2006

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

The partition of a strong tournament.
Discrete Mathematics, 2005

2004
A note on pancyclism of highly connected graphs.
Discrete Mathematics, 2004

Cycles through given vertices and closures.
Discrete Mathematics, 2004

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

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

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

A note on a new condition implying pancyclism.
Discussiones Mathematicae Graph Theory, 2001

Clique covering and degree conditions for hamiltonicity in claw-free graphs.
Discrete Mathematics, 2001

On quasifactorability in graphs.
Discrete Mathematics, 2001

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

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

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

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

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

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

An Ore-type condition for pancyclability.
Discrete Mathematics, 1999

On 2-factors in claw-free graphs.
Discrete Mathematics, 1999

1998
Global insertion and hamiltonicity in DCT-graphs.
Discrete Mathematics, 1998

1997
Hamiltonicity of 2-connected claw-center independent graphs.
Discrete Mathematics, 1997

Cycles through subsets with large degree sums.
Discrete Mathematics, 1997

Dlambda-cycles in lambda-claw-free graphs.
Discrete Mathematics, 1997

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

Pancyclism and small cycles in graphs.
Discussiones Mathematicae Graph Theory, 1996

Strong edge colorings of graphs.
Discrete Mathematics, 1996

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

1995
Dominating cycles in bipartite biclaw-free graphs.
Discrete Mathematics, 1995

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

Hamiltonicity of Bipartite Biclaw-free Graphs.
Discrete Applied Mathematics, 1994

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

On hamiltonian claw-free graphs.
Discrete Mathematics, 1993

1991
Hamiltonism, degree sum and neighborhood intersections.
Discrete Mathematics, 1991

The product of the independent domination numbers of a graph and its complement.
Discrete Mathematics, 1991


  Loading...