Hao Li

Publication Activity (10 Years)

Years Active: 1991-2022
Publications (10 Years): 19

Top Topics

Connected Graphs

Hamiltonian Cycle

Top Venues

Discret. Appl. Math.

Discuss. Math. Graph Theory

Publications

Hao Li, Guanghui Wang, Wenling Zhou
Integer colorings with no rainbow k-term arithmetic progression. Eur. J. Comb. 104 (2022)
Jie Hu, Hao Li, Shun-ichi Maezawa
Maximum properly colored trees in edge-colored graphs. J. Comb. Optim. 44 (1) (2022)
Wantao Ning, Hao Li
The generalized measure of edge fault tolerance in exchanged crossed cube. Theor. Comput. Sci. 861 (2021)
Suyun Jiang, Hao Li, Jin Yan
Vertex-disjoint stars in K1, r-free graphs. Discret. Appl. Math. 302 (2021)
Weihua He, Hao Li, Qiang Sun
Locating any two vertices on Hamiltonian cycles in large graphs. Discret. Math. 343 (9) (2020)
Jie Hu, Hao Li, Donglei Yang
Vertex-disjoint rainbow triangles in edge-colored graphs. Discret. Math. 343 (12) (2020)
Hao Li, Heping Zhang
The isolated-pentagon rule and nice substructures in fullerenes. Ars Math. Contemp. 15 (2) (2018)
Paul Balister, Hao Li, Richard H. Schelp
Decompositions of graphs into cycles with chords. J. Comb. Theory, Ser. B 128 (2018)
Junqing Cai, Hao Li, Yuzhong Zhang
-connected 2-heavy graphs to be hamiltonian. Inf. Process. Lett. 134 (2018)
Junqing Cai, Hao Li, Qiang Sun
Longest cycles in 4-connected graphs. Discret. Math. 340 (12) (2017)
Weihua He, Hao Li, Shuofa Xiao
On the minimum Kirchhoff index of graphs with a given vertex k-partiteness and edge k-partiteness. Appl. Math. Comput. 315 (2017)
Evelyne Flandrin, Hao Li, Antoni Marczyk, Jean-François Saclé, Mariusz Wozniak
A note on neighbor expanded sum distinguishing index. Discuss. Math. Graph Theory 37 (1) (2017)
Weisheng Zhao, Fan Wang, Xiaolu Gao, Hao Li
Bondage number of the strong product of two trees. Discret. Appl. Math. 230 (2017)
Hao Li, Weihua He, Weihua Yang, Yandong Bai
Hamiltonian cycles in spanning subgraphs of line graphs. Discret. Appl. Math. 209 (2016)
Yandong Bai, Binlong Li, Hao Li, Weihua He
Universal arcs in tournaments. Discret. Math. 339 (8) (2016)
Ralph J. Faudree, Hao Li, Kiyoshi Yoshimoto
Locating sets of vertices on Hamiltonian cycles. Discret. Appl. Math. 209 (2016)
Junqing Cai, Hao Li
Hamilton Cycles in Implicit 2-Heavy Graphs. Graphs Comb. 32 (4) (2016)
Hao Li, Weihua He, Weihua Yang, Yandong Bai
A Note on Edge-Disjoint Hamilton Cycles in Line Graphs. Graphs Comb. 32 (2) (2016)
Hao Li, Yandong Bai, Weihua He, Qiang Sun
Vertex-distinguishing proper arc colorings of digraphs. Discret. Appl. Math. 209 (2016)
Yandong Bai, Binlong Li, Hao Li
Vertex-disjoint cycles in bipartite tournaments. Discret. Math. 338 (8) (2015)
Yang Yi, Meirun Chen, Hao Li, Lian Li
Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model. J. Appl. Math. 2014 (2014)
Junqing Cai, Hao Li
A new sufficient condition for pancyclability of graphs. Discret. Appl. Math. 162 (2014)
Yandong Bai, Hao Li, Weihua He
Complementary cycles in regular bipartite tournaments. Discret. Math. 333 (2014)
Junqing Cai, Hao Li, Wantao Ning
An implicit weighted degree condition for heavy cycles. Discuss. Math. Graph Theory 34 (4) (2014)
Yi Yang, Lian Li, Hao Li
Data forwarding of realtime mobile target tracking in wireless sensor networks. J. Ambient Intell. Humaniz. Comput. 4 (1) (2013)
Hao Li, Junqing Cai, Wantao Ning
An Implicit Degree Condition for Pancyclicity of Graphs. Graphs Comb. 29 (5) (2013)
Hao Li
Generalizations of Dirac's theorem in Hamiltonian graph theory - A survey. Discret. Math. 313 (19) (2013)
Junqing Cai, Hao Li, Wantao Ning
An implicit degree condition for hamiltonian cycles. Ars Comb. 108 (2013)
Hao Li
's in edge-colored graphs. Discret. Math. 313 (19) (2013)
Hao Li, Guanghui Wang
Color degree and heterochromatic cycles in edge-colored graphs. Eur. J. Comb. 33 (8) (2012)
Ralph J. Faudree, Hao Li
Locating pairs of vertices on Hamiltonian cycles. Discret. Math. 312 (17) (2012)
Guanghui Wang, Hao Li, Yan Zhu, Guizhen Liu
A Note on Heterochromatic C 4 in Edge-Colored Triangle-Free Graphs. Graphs Comb. 28 (6) (2012)
Ervin Györi, Hao Li
-Free Graphs. Comb. Probab. Comput. 21 (1-2) (2012)
Hao Li, Wantao Ning, Junqing Cai
An implicit degree condition for hamiltonian graphs. Discret. Math. 312 (14) (2012)
Hao Li, Wantao Ning, Junqing Cai
An Implicit Degree Condition for Cyclability in Graphs. FAW-AAIM (2011)
Evelyne Flandrin, Ervin Györi, Hao Li, Jinlong Shu
-free graphs. Discret. Math. 310 (20) (2010)
Shan Zhou, Hao Li, Guanghui Wang
Algorithm for two disjoint long paths in 2-connected graphs. Theor. Comput. Sci. 411 (34-36) (2010)
Hao Li, Shan Zhou, Guanghui Wang
The k-dominating cycles in graphs. Eur. J. Comb. 31 (2) (2010)
Hao Li, Mariusz Wozniak
A note on graphs containing all trees of a given size. Ars Comb. 94 (2010)
Guanghui Wang, Hao Li
Color degree and alternating cycles in edge-colored graphs. Discret. Math. 309 (13) (2009)
Evelyne Flandrin, Hao Li, Bing Wei
A sufficient condition for pancyclability of graphs. Discret. Math. 309 (1) (2009)
Roman Cada, Evelyne Flandrin, Hao Li
Hamiltonicity and pancyclicity of cartesian products of graphs. Discret. Math. 309 (22) (2009)
Hao Li, Xueliang Li, Guizhen Liu, Guanghui Wang
The heterochromatic matchings in edge-colored bipartite graphs. Ars Comb. 93 (2009)
Evelyne Flandrin, Tomás Kaiser, Roman Kuzel, Hao Li, Zdenek Ryjácek
Neighborhood unions and extremal spanning trees. Discret. Math. 308 (12) (2008)
Guanghui Wang, Hao Li
Heterochromatic Matchings in Edge-Colored Graphs. Electron. J. Comb. 15 (1) (2008)
Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak
A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs. Discret. Math. 307 (7-8) (2007)
Tomás Kaiser, Roman Kuzel, Hao Li, Guanghui Wang
-walks in Bridgeless Graphs. Graphs Comb. 23 (3) (2007)
Hao Li, Guanghui Wang, Shan Zhou
Long Alternating Cycles in Edge-Colored Complete Graphs. FAW (2007)
Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak
A Chvátal-Erdos type condition for pancyclability. Discret. Math. 307 (11-12) (2007)
Hao Li, Evelyne Flandrin, Jinlong Shu
A sufficient condition for cyclability in directed graphs. Discret. Math. 307 (11-12) (2007)
Evelyne Flandrin, Hao Li, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak
Chvátal-Erdös condition and pancyclism. Discuss. Math. Graph Theory 26 (2) (2006)
Evelyne Flandrin, Hao Li, Roman Cada
Hamiltonicity and pancyclicity of generalized prisms. Electron. Notes Discret. Math. 24 (2006)
Hao Li, Jinlong Shu
The partition of a strong tournament. Discret. Math. 290 (2/3) (2005)
Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak
A Note on a Generalisation of Ore's Condition. Graphs Comb. 21 (2) (2005)
Hao Li, Jinlong Shu
Partitioning a strong tournament into k cycles. Ars Comb. 72 (2004)
Hikoe Enomoto, Hao Li
Partition of a graph into cycles and degenerated cycles. Discret. Math. 276 (1-3) (2004)
Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp
Balanced edge colorings. J. Comb. Theory, Ser. B 90 (1) (2004)
Roman Cada, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
Cycles through given vertices and closures. Discret. Math. 276 (1-3) (2004)
Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak
A note on pancyclism of highly connected graphs. Discret. Math. 286 (1-2) (2004)
Yoshimi Egawa, Hikoe Enomoto, Ralph J. Faudree, Hao Li, Ingo Schiermeyer
Two-factors each component of which contains a specified vertex. J. Graph Theory 43 (3) (2003)
Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree. Discret. Math. 236 (1-3) (2001)
Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
Clique covering and degree conditions for hamiltonicity in claw-free graphs. Discret. Math. 236 (1-3) (2001)
Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak
Partitioning vertices of 1-tough graphs into paths. Theor. Comput. Sci. 263 (1-2) (2001)
Guantao Chen, Ronald J. Gould, Hao Li
Partitioning Vertices of a Tournament into Independent Cycles. J. Comb. Theory, Ser. B 83 (2) (2001)
Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak
A note on a new condition implying pancyclism. Discuss. Math. Graph Theory 21 (1) (2001)
Mao-cheng Cai, Evelyne Flandrin, Hao Li
On quasifactorability in graphs. Discret. Math. 233 (1-3) (2001)
Amel Harkat-Benhamdine, Hao Li, Feng Tian
Cyclability of 3-connected graphs. J. Graph Theory 34 (3) (2000)
Cristina Bazgan, Hao Li, Mariusz Wozniak
On the Loebl-Komlós-Sós conjecture. J. Graph Theory 34 (4) (2000)
Mao-cheng Cai, Odile Favaron, Hao Li
(2, k)-Factor-Critical Graphs and Toughness. Graphs Comb. 15 (2) (1999)
Odile Favaron, Evelyne Flandrin, Hao Li, Feng Tian
An Ore-type condition for pancyclability. Discret. Math. 206 (1-3) (1999)
Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li, Zhenhong Liu
On 2-factors in claw-free graphs. Discret. Math. 206 (1-3) (1999)
Chuanping Chen, Amel Harkat-Benhamdine, Hao Li
Distance-Dominating Cycles in Quasi Claw-Free Graphs. Graphs Comb. 15 (3) (1999)
Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs. J. Comb. Theory, Ser. B 75 (2) (1999)
Hao Li, Mei Lu, Zhiren Sun
Hamiltonicity in 2-connected graphs with claws. Discret. Math. 183 (1-3) (1998)
Ahmed Ainouche, Odile Favaron, Hao Li
Global insertion and hamiltonicity in DCT-graphs. Discret. Math. 184 (1-3) (1998)
Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Amel Harkat-Benhamdine, Hao Li
Dlambda-cycles in lambda-claw-free graphs. Discret. Math. (1997)
Hao Li, Mei Lu, Feng Tian, Bing Wei
Hamiltonicity of 2-connected claw-center independent graphs. Discret. Math. (1997)
Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman
Cycles through subsets with large degree sums. Discret. Math. 171 (1-3) (1997)
Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li
Pancyclism and small cycles in graphs. Discuss. Math. Graph Theory 16 (1) (1996)
Odile Favaron, Hao Li, Richard H. Schelp
Strong edge colorings of graphs. Discret. Math. 159 (1-3) (1996)
Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
Shortest walks in almost claw-free graphs. Ars Comb. 42 (1996)
Odile Favaron, Evelyne Flandrin, Hao Li, Yiping Liu, Feng Tian, Zhengsheng Wu
Sequences, claws and cyclability of graphs. J. Graph Theory 21 (4) (1996)
Daniel Barraez, Evelyne Flandrin, Hao Li, Oscar Ordaz
Dominating cycles in bipartite biclaw-free graphs. Discret. Math. 146 (1-3) (1995)
Evelyne Flandrin, Jean-Luc Fouquet, Hao Li
Hamiltonicity of Bipartite Biclaw-free Graphs. Discret. Appl. Math. 51 (1-2) (1994)
Evelyne Flandrin, Hao Li
Mengerian properties, hamiltonicity, and claw-free graphs. Networks 24 (3) (1994)
Evelyne Flandrin, Jean-Luc Fouquet, Hao Li
On hamiltonian claw-free graphs. Discret. Math. 111 (1-3) (1993)
Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li
The complete closure of a graph. J. Graph Theory 17 (4) (1993)
Ernest J. Cockayne, Odile Favaron, Hao Li, Gary MacGillivray
The product of the independent domination numbers of a graph and its complement. Discret. Math. 90 (3) (1991)
Evelyne Flandrin, H. A. Jung, Hao Li
Hamiltonism, degree sum and neighborhood intersections. Discret. Math. 90 (1) (1991)