The product of the independent domination numbers of a graph and its complement. - Ernest J. Cockayne; Odile Favaron; Hao Li 002; Gary MacGillivray (Discret. Math., 1991)

Hamiltonism, degree sum and neighborhood intersections. - Evelyne Flandrin; Heinz Adolf Jung; Hao Li 002 (Discret. Math., 1991)

On hamiltonian claw-free graphs. - Evelyne Flandrin; Jean-Luc Fouquet; Hao Li 002 (Discret. Math., 1993)

The complete closure of a graph. - Ralph J. Faudree; Odile Favaron; Evelyne Flandrin; Hao Li 002 (J. Graph Theory, 1993)

Hamiltonicity of Bipartite Biclaw-free Graphs. - Evelyne Flandrin; Jean-Luc Fouquet; Hao Li 002 (Discret. Appl. Math., 1994)

Mengerian properties, hamiltonicity, and claw-free graphs. - Evelyne Flandrin; Hao Li 002 (Networks, 1994)

Dominating cycles in bipartite biclaw-free graphs. - Daniel Barraez; Evelyne Flandrin; Hao Li 002; Oscar Ordaz (Discret. Math., 1995)

Shortest walks in almost claw-free graphs. - Odile Favaron; Evelyne Flandrin; Hao Li 002; Zdenek Ryjácek (Ars Comb., 1996)

Strong edge colorings of graphs. - Odile Favaron; Hao Li 002; Richard H. Schelp (Discret. Math., 1996)

Pancyclism and small cycles in graphs. - Ralph J. Faudree; Odile Favaron; Evelyne Flandrin; Hao Li 002 (Discuss. Math. Graph Theory, 1996)

Sequences, claws and cyclability of graphs. - Odile Favaron; Evelyne Flandrin; Hao Li 002; Yiping Liu; Feng Tian 008; Zhengsheng Wu (J. Graph Theory, 1996)

Dlambda-cycles in lambda-claw-free graphs. - Mohamed El Kadi Abderrezzak; Evelyne Flandrin; Amel Harkat-Benhamdine; Hao Li 002 (Discret. Math., 1997)

Cycles through subsets with large degree sums. - Hajo Broersma; Hao Li 002; Jianping Li 007; Feng Tian 008; Henk Jan Veldman (Discret. Math., 1997)

Hamiltonicity of 2-connected claw-center independent graphs. - Hao Li 002; Mei Lu; Feng Tian 008; Bing Wei 001 (Discret. Math., 1997)

Global insertion and hamiltonicity in DCT-graphs. - Ahmed Ainouche; Odile Favaron; Hao Li 002 (Discret. Math., 1998)

Hamiltonicity in 2-connected graphs with claws. - Hao Li 002; Mei Lu; Zhiren Sun (Discret. Math., 1998)

On 2-factors in claw-free graphs. - Ralph J. Faudree; Odile Favaron; Evelyne Flandrin; Hao Li 002; Zhenhong Liu (Discret. Math., 1999)

An Ore-type condition for pancyclability. - Odile Favaron; Evelyne Flandrin; Hao Li 002; Feng Tian 008 (Discret. Math., 1999)

(2, k)-Factor-Critical Graphs and Toughness. - Mao-cheng Cai; Odile Favaron; Hao Li 002 (Graphs Comb., 1999)

Distance-Dominating Cycles in Quasi Claw-Free Graphs. - Chuanping Chen; Amel Harkat-Benhamdine; Hao Li 002 (Graphs Comb., 1999)

On the Vertex-Distinguishing Proper Edge-Colorings of Graphs. - Cristina Bazgan; Amel Harkat-Benhamdine; Hao Li 002; Mariusz Wozniak (J. Comb. Theory B, 1999)

On the Loebl-Komlós-Sós conjecture. - Cristina Bazgan; Hao Li 002; Mariusz Wozniak (J. Graph Theory, 2000)

Cyclability of 3-connected graphs. - Amel Harkat-Benhamdine; Hao Li 002; Feng Tian 008 (J. Graph Theory, 2000)

A note on the vertex-distinguishing proper coloring of graphs with large minimum degree. - Cristina Bazgan; Amel Harkat-Benhamdine; Hao Li 002; Mariusz Wozniak (Discret. Math., 2001)

On quasifactorability in graphs. - Mao-cheng Cai; Evelyne Flandrin; Hao Li 002 (Discret. Math., 2001)

Clique covering and degree conditions for hamiltonicity in claw-free graphs. - Odile Favaron; Evelyne Flandrin; Hao Li 002; Zdenek Ryjácek (Discret. Math., 2001)

A note on a new condition implying pancyclism. - Evelyne Flandrin; Hao Li 002; Antoni Marczyk; Mariusz Wozniak (Discuss. Math. Graph Theory, 2001)

Partitioning Vertices of a Tournament into Independent Cycles. - Guantao Chen; Ronald J. Gould; Hao Li 002 (J. Comb. Theory B, 2001)

Partitioning vertices of 1-tough graphs into paths. - Cristina Bazgan; Amel Harkat-Benhamdine; Hao Li 002; Mariusz Wozniak (Theor. Comput. Sci., 2001)

Two-factors each component of which contains a specified vertex. - Yoshimi Egawa; Hikoe Enomoto; Ralph J. Faudree; Hao Li 002; Ingo Schiermeyer (J. Graph Theory, 2003)

Partitioning a strong tournament into k cycles. - Hao Li 002; Jinlong Shu (Ars Comb., 2004)

Cycles through given vertices and closures. - Roman Cada; Evelyne Flandrin; Hao Li 002; Zdenek Ryjácek (Discret. Math., 2004)

Partition of a graph into cycles and degenerated cycles. - Hikoe Enomoto; Hao Li 002 (Discret. Math., 2004)

A note on pancyclism of highly connected graphs. - Evelyne Flandrin; Hao Li 002; Antoni Marczyk; Mariusz Wozniak (Discret. Math., 2004)

Balanced edge colorings. - Paul N. Balister; Alexandr V. Kostochka; Hao Li 002; Richard H. Schelp (J. Comb. Theory B, 2004)

The partition of a strong tournament. - Hao Li 002; Jinlong Shu (Discret. Math., 2005)

A Note on a Generalisation of Ore's Condition. - Evelyne Flandrin; Hao Li 002; Antoni Marczyk; Mariusz Wozniak (Graphs Comb., 2005)

Chvátal-Erdös condition and pancyclism. - Evelyne Flandrin; Hao Li 002; Antoni Marczyk; Ingo Schiermeyer; Mariusz Wozniak (Discuss. Math. Graph Theory, 2006)

Hamiltonicity and pancyclicity of generalized prisms. - Evelyne Flandrin; Hao Li 002; Roman Cada (Electron. Notes Discret. Math., 2006)

Long Alternating Cycles in Edge-Colored Complete Graphs. - Hao Li 002; Guanghui Wang 002; Shan Zhou (FAW, 2007)

A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs. - Evelyne Flandrin; Hao Li 002; Antoni Marczyk; Mariusz Wozniak (Discret. Math., 2007)

A Chvátal-Erdos type condition for pancyclability. - Evelyne Flandrin; Hao Li 002; Antoni Marczyk; Mariusz Wozniak (Discret. Math., 2007)

A sufficient condition for cyclability in directed graphs. - Hao Li 002; Evelyne Flandrin; Jinlong Shu (Discret. Math., 2007)

A Note on k -walks in Bridgeless Graphs. - Tomás Kaiser; Roman Kuzel; Hao Li 002; Guanghui Wang 002 (Graphs Comb., 2007)

Heterochromatic Matchings in Edge-Colored Graphs. - Guanghui Wang 002; Hao Li 002 (Electron. J. Comb., 2008)

Neighborhood unions and extremal spanning trees. - Evelyne Flandrin; Tomás Kaiser; Roman Kuzel; Hao Li 002; Zdenek Ryjácek (Discret. Math., 2008)

Long paths with endpoints in given vertex-subsets of graphs. - Hao Li 002; Jianping Li 007 (Discret. Math., 2008)

Energy conservation in wireless sensor networks and connectivity of graphs. - Hao Li 002; Huifang Miao; Li Liu 001; Lian Li 003; Heping Zhang (Theor. Comput. Sci., 2008)

Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks. - Li Liu 001; Hao Li 002; Junling Wang; Lian Li 003; Caihong Li (FAW, 2009)

Achieving Energy Conservation, Coverage and Connectivity Requirements in Wireless Sensor Networks. - Li Liu 001; Bin Hu 001; Huifang Miao; Hao Li 002; Lian Li 003; Qinglin Zhao (ICDCS Workshops, 2009)

The heterochromatic matchings in edge-colored bipartite graphs. - Hao Li 002; Xueliang Li 001; Guizhen Liu; Guanghui Wang 002 (Ars Comb., 2009)

Hamiltonicity and pancyclicity of cartesian products of graphs. - Roman Cada; Evelyne Flandrin; Hao Li 002 (Discret. Math., 2009)

A sufficient condition for pancyclability of graphs. - Evelyne Flandrin; Hao Li 002; Bing Wei 001 (Discret. Math., 2009)

Color degree and alternating cycles in edge-colored graphs. - Guanghui Wang 002; Hao Li 002 (Discret. Math., 2009)

A note on graphs containing all trees of a given size. - Hao Li 002; Mariusz Wozniak (Ars Comb., 2010)

Cyclability in k-connected K1, 4-free graphs. - Evelyne Flandrin; Ervin Györi; Hao Li 002; Jinlong Shu (Discret. Math., 2010)

The k-dominating cycles in graphs. - Hao Li 002; Shan Zhou; Guanghui Wang 002 (Eur. J. Comb., 2010)

Algorithm for two disjoint long paths in 2-connected graphs. - Shan Zhou; Hao Li 002; Guanghui Wang 002 (Theor. Comput. Sci., 2010)

An Implicit Degree Condition for Cyclability in Graphs. - Hao Li 002; Wantao Ning; Junqing Cai (FAW-AAIM, 2011)

The Maximum Number of Triangles in C2k+1-Free Graphs. - Ervin Györi; Hao Li 002 (Comb. Probab. Comput., 2012)

Locating pairs of vertices on Hamiltonian cycles. - Ralph J. Faudree; Hao Li 002 (Discret. Math., 2012)

An implicit degree condition for hamiltonian graphs. - Hao Li 002; Wantao Ning; Junqing Cai (Discret. Math., 2012)

Color degree and heterochromatic cycles in edge-colored graphs. - Hao Li 002; Guanghui Wang 002 (Eur. J. Comb., 2012)

A Note on Heterochromatic C 4 in Edge-Colored Triangle-Free Graphs. - Guanghui Wang 002; Hao Li 002; Yan Zhu 008; Guizhen Liu (Graphs Comb., 2012)

An implicit degree condition for hamiltonian cycles. - Junqing Cai; Hao Li 002; Wantao Ning (Ars Comb., 2013)

Rainbow C3's and c4's in edge-colored graphs. - Hao Li 002 (Discret. Math., 2013)

Generalizations of Dirac's theorem in Hamiltonian graph theory - A survey. - Hao Li 002 (Discret. Math., 2013)

An Implicit Degree Condition for Pancyclicity of Graphs. - Hao Li 002; Junqing Cai; Wantao Ning (Graphs Comb., 2013)

Data forwarding of realtime mobile target tracking in wireless sensor networks. - Yi Yang 017; Lian Li 003; Hao Li 002 (J. Ambient Intell. Humaniz. Comput., 2013)

A new sufficient condition for pancyclability of graphs. - Junqing Cai; Hao Li 002 (Discret. Appl. Math., 2014)

Complementary cycles in regular bipartite tournaments. - Yandong Bai; Hao Li 002; Weihua He (Discret. Math., 2014)

An implicit weighted degree condition for heavy cycles. - Junqing Cai; Hao Li 002; Wantao Ning (Discuss. Math. Graph Theory, 2014)

Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model. - Yang Yi; Meirun Chen; Hao Li 002; Lian Li 003 (J. Appl. Math., 2014)

Vertex-disjoint cycles in bipartite tournaments. - Yandong Bai; Binlong Li; Hao Li 002 (Discret. Math., 2015)

Locating sets of vertices on Hamiltonian cycles. - Ralph J. Faudree; Hao Li 002; Kiyoshi Yoshimoto (Discret. Appl. Math., 2016)

Vertex-distinguishing proper arc colorings of digraphs. - Hao Li 002; Yandong Bai; Weihua He; Qiang Sun 004 (Discret. Appl. Math., 2016)

Hamiltonian cycles in spanning subgraphs of line graphs. - Hao Li 002; Weihua He; Weihua Yang; Yandong Bai (Discret. Appl. Math., 2016)

Universal arcs in tournaments. - Yandong Bai; Binlong Li; Hao Li 002; Weihua He (Discret. Math., 2016)

Hamilton Cycles in Implicit 2-Heavy Graphs. - Junqing Cai; Hao Li 002 (Graphs Comb., 2016)

A Note on Edge-Disjoint Hamilton Cycles in Line Graphs. - Hao Li 002; Weihua He; Weihua Yang; Yandong Bai (Graphs Comb., 2016)

On the minimum Kirchhoff index of graphs with a given vertex k-partiteness and edge k-partiteness. - Weihua He; Hao Li 002; Shuofa Xiao (Appl. Math. Comput., 2017)

Bondage number of the strong product of two trees. - Weisheng Zhao; Fan Wang 007; Xiaolu Gao; Hao Li 002 (Discret. Appl. Math., 2017)

Longest cycles in 4-connected graphs. - Junqing Cai; Hao Li 002; Qiang Sun 004 (Discret. Math., 2017)

A note on neighbor expanded sum distinguishing index. - Evelyne Flandrin; Hao Li 002; Antoni Marczyk; Jean-François Saclé; Mariusz Wozniak (Discuss. Math. Graph Theory, 2017)

The isolated-pentagon rule and nice substructures in fullerenes. - Hao Li 002; Heping Zhang (Ars Math. Contemp., 2018)

An implicit degree condition for k-connected 2-heavy graphs to be hamiltonian. - Junqing Cai; Hao Li 002; Yuzhong Zhang (Inf. Process. Lett., 2018)

Decompositions of graphs into cycles with chords. - Paul Balister; Hao Li 002; Richard H. Schelp (J. Comb. Theory B, 2018)

Locating any two vertices on Hamiltonian cycles in large graphs. - Weihua He; Hao Li 002; Qiang Sun 004 (Discret. Math., 2020)

Vertex-disjoint rainbow triangles in edge-colored graphs. - Jie Hu; Hao Li 002; Donglei Yang (Discret. Math., 2020)

Vertex-disjoint stars in K1, r-free graphs. - Suyun Jiang; Hao Li 002; Jin Yan (Discret. Appl. Math., 2021)

The generalized measure of edge fault tolerance in exchanged crossed cube. - Wantao Ning; Hao Li 002 (Theor. Comput. Sci., 2021)

Integer colorings with no rainbow k-term arithmetic progression. - Hao Li 002; Guanghui Wang 002; Wenling Zhou (Eur. J. Comb., 2022)

Maximum properly colored trees in edge-colored graphs. - Jie Hu; Hao Li 002; Shun-ichi Maezawa (J. Comb. Optim., 2022)

Rainbow directed version of Dirac's theorem. - Hao Li 002; Luyi Li; Ping Li 025; Xueliang Li 001 (Discret. Math., 2025)