default search action
Hao Li 0002
Person information
- affiliation: Université de Paris-Sud, Laboratoire de Recherche en Informatique, France
- affiliation: Lanzhou University, School of Mathematics and Statistics, China
Other persons with the same name
- Hao Li — disambiguation page
- Hao Li 0001 — University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering, IL, USA (and 1 more)
- Hao Li 0003
— Queen's University, Department of Electrical and Computer Engineering, Kingston, ON, Canada
- Hao Li 0004
- Hao Li 0005
- Hao Li 0006
- Hao Li 0007 — Xi'an Jiaotong University, Department of Microelectronics, China
- Hao Li 0008 — Guangdong Inspection and Quarantine Technology Center, China
- Hao Li 0009
- Hao Li 0010 — University of Western Ontario, Department of Electrical and Computer Engineering, London, ON, Canada
- Hao Li 0011
- Hao Li 0012
- Hao Li 0013
- Hao Li 0014 — Tsinghua University, Beijing, China
- Hao Li 0015
- Hao Li 0016
- Hao Li 0017
- Hao Li 0018
- Hao Li 0019
- Hao Li 0020
- Hao Li 0021 — Yunnan University, School of Software, China (and 1 more)
- Hao Li 0022 — University of Maryland, College Park, MD, USA
- Hao Li 0023
- Hao Li 0024
- Hao Li 0025
- Hao Li 0026
- Hao Li 0027
- Hao Li 0028
- Hao Li 0029
- Hao Li 0030
- Hao Li 0031 — Rensselaer Polytechnic Institute, Troy, NY, USA (and 1 more)
- Hao Li 0032 — National University of Singapore, Department of Computer Science, Singapore
- Hao Li 0033
- Hao Li 0034
- Hao Li 0035
- Hao Li 0036
- Hao Li 0037
- Hao Li 0038
- Hao Li 0039
- Hao Li 0040
- Hao Li 0041
- Hao Li 0042
- Hao Li 0043
- Hao Li 0044
- Hao Li 0045
- Hao Li 0046
- Hao Li 0047
- Hao Li 0048 — Northeastern University, Department of Communication and Electronic Engineering, Shenyang, China
- Hao Li 0049 — China Academy of Space Technology, Xi'an, China (and 1 more)
- Hao Li 0050
- Hao Li 0051 — Xidian University, School of Artificial Intelligence, Xi'an, China
- Hao Li 0052
- Hao Li 0053
- Hao Li 0054
- Hao Li 0055
- Hao Li 0056
- Hao Li 0057
- Hao Li 0058
- Hao Li 0059
- Hao Li 0060
- Hao Li 0061
- Hao Li 0062
- Hao Li 0063
- Hao Li 0064
- Hao Li 0065
- Hao Li 0066
- Hao Li 0067
- Hao Li 0068
- Hao Li 0069 — Chinese University of Hong Kong, SAR, China (and 1 more)
- Hao Li 0070
- Hao Li 0071 — University of South Florida, Tampa, USA
- Hao Li 0072 — University of Calgary, Alberta, Canada
- Hao Li 0073
- Hao Li 0074
- Hao Li 0075
- Hao Li 0076
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j89]Hao Li, Guanghui Wang, Wenling Zhou
Integer colorings with no rainbow k-term arithmetic progression. Eur. J. Comb. 104: 103547 (2022) - [j88]Jie Hu, Hao Li, Shun-ichi Maezawa
Maximum properly colored trees in edge-colored graphs. J. Comb. Optim. 44(1): 154-171 (2022) - 2021
- [j87]Suyun Jiang
Vertex-disjoint stars in K1, r-free graphs. Discret. Appl. Math. 302: 189-197 (2021) - [j86]Wantao Ning, Hao Li:
The generalized measure of edge fault tolerance in exchanged crossed cube. Theor. Comput. Sci. 861: 80-84 (2021) - 2020
- [j85]Weihua He
Locating any two vertices on Hamiltonian cycles in large graphs. Discret. Math. 343(9): 111941 (2020) - [j84]Jie Hu, Hao Li, Donglei Yang
Vertex-disjoint rainbow triangles in edge-colored graphs. Discret. Math. 343(12): 112117 (2020)
2010 – 2019
- 2018
- [j83]Hao Li, Heping Zhang:
The isolated-pentagon rule and nice substructures in fullerenes. Ars Math. Contemp. 15(2): 487-497 (2018) - [j82]Junqing Cai
An implicit degree condition for k-connected 2-heavy graphs to be hamiltonian. Inf. Process. Lett. 134: 9-13 (2018) - [j81]Paul Balister
Decompositions of graphs into cycles with chords. J. Comb. Theory B 128: 47-65 (2018) - 2017
- [j80]Weihua He
On the minimum Kirchhoff index of graphs with a given vertex k-partiteness and edge k-partiteness. Appl. Math. Comput. 315: 313-318 (2017) - [j79]Weisheng Zhao, Fan Wang, Xiaolu Gao, Hao Li:
Bondage number of the strong product of two trees. Discret. Appl. Math. 230: 133-145 (2017) - [j78]Junqing Cai
Longest cycles in 4-connected graphs. Discret. Math. 340(12): 2955-2966 (2017) - [j77]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): 29-37 (2017) - 2016
- [j76]Ralph J. Faudree, Hao Li, Kiyoshi Yoshimoto:
Locating sets of vertices on Hamiltonian cycles. Discret. Appl. Math. 209: 107-114 (2016) - [j75]Hao Li, Yandong Bai, Weihua He, Qiang Sun:
Vertex-distinguishing proper arc colorings of digraphs. Discret. Appl. Math. 209: 276-286 (2016) - [j74]Hao Li, Weihua He
Hamiltonian cycles in spanning subgraphs of line graphs. Discret. Appl. Math. 209: 287-295 (2016) - [j73]Yandong Bai
Universal arcs in tournaments. Discret. Math. 339(8): 2063-2065 (2016) - [j72]Hao Li, Weihua He
A Note on Edge-Disjoint Hamilton Cycles in Line Graphs. Graphs Comb. 32(2): 741-744 (2016) - [j71]Junqing Cai, Hao Li:
Hamilton Cycles in Implicit 2-Heavy Graphs. Graphs Comb. 32(4): 1329-1337 (2016) - 2015
- [j70]Yandong Bai
Vertex-disjoint cycles in bipartite tournaments. Discret. Math. 338(8): 1307-1309 (2015) - 2014
- [j69]Junqing Cai, Hao Li:
A new sufficient condition for pancyclability of graphs. Discret. Appl. Math. 162: 142-148 (2014) - [j68]Yandong Bai
Complementary cycles in regular bipartite tournaments. Discret. Math. 333: 14-27 (2014) - [j67]Junqing Cai, Hao Li, Wantao Ning:
An implicit weighted degree condition for heavy cycles. Discuss. Math. Graph Theory 34(4): 801-810 (2014) - [j66]Yang Yi, Meirun Chen, Hao Li, Lian Li:
Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model. J. Appl. Math. 2014: 592638:1-592638:10 (2014) - 2013
- [j65]Junqing Cai, Hao Li, Wantao Ning:
An implicit degree condition for hamiltonian cycles. Ars Comb. 108: 365-378 (2013) - [j64]Hao Li:
Rainbow C3's and c4's in edge-colored graphs. Discret. Math. 313(19): 1893-1896 (2013) - [j63]Hao Li:
Generalizations of Dirac's theorem in Hamiltonian graph theory - A survey. Discret. Math. 313(19): 2034-2053 (2013) - [j62]Hao Li, Junqing Cai, Wantao Ning:
An Implicit Degree Condition for Pancyclicity of Graphs. Graphs Comb. 29(5): 1459-1469 (2013) - [j61]Yi Yang, Lian Li, Hao Li:
Data forwarding of realtime mobile target tracking in wireless sensor networks. J. Ambient Intell. Humaniz. Comput. 4(1): 109-120 (2013) - 2012
- [j60]Ervin Györi, Hao Li:
The Maximum Number of Triangles in C2k+1-Free Graphs. Comb. Probab. Comput. 21(1-2): 187-191 (2012) - [j59]Hao Li, Wantao Ning, Junqing Cai:
An implicit degree condition for hamiltonian graphs. Discret. Math. 312(14): 2190-2196 (2012) - [j58]Ralph J. Faudree, Hao Li:
Locating pairs of vertices on Hamiltonian cycles. Discret. Math. 312(17): 2700-2706 (2012) - [j57]Hao Li, Guanghui Wang:
Color degree and heterochromatic cycles in edge-colored graphs. Eur. J. Comb. 33(8): 1958-1964 (2012) - [j56]Guanghui Wang, Hao Li, Yan Zhu
A Note on Heterochromatic C 4 in Edge-Colored Triangle-Free Graphs. Graphs Comb. 28(6): 901-905 (2012) - 2011
- [c4]Hao Li, Wantao Ning, Junqing Cai:
An Implicit Degree Condition for Cyclability in Graphs. FAW-AAIM 2011: 82-89 - 2010
- [j55]Hao Li, Mariusz Wozniak:
A note on graphs containing all trees of a given size. Ars Comb. 94 (2010) - [j54]Evelyne Flandrin, Ervin Györi, Hao Li, Jinlong Shu:
Cyclability in k-connected K1, 4-free graphs. Discret. Math. 310(20): 2735-2741 (2010) - [j53]Hao Li, Shan Zhou, Guanghui Wang:
The k-dominating cycles in graphs. Eur. J. Comb. 31(2): 608-616 (2010) - [j52]Shan Zhou, Hao Li, Guanghui Wang:
Algorithm for two disjoint long paths in 2-connected graphs. Theor. Comput. Sci. 411(34-36): 3247-3254 (2010)
2000 – 2009
- 2009
- [j51]Hao Li, Xueliang Li, Guizhen Liu, Guanghui Wang:
The heterochromatic matchings in edge-colored bipartite graphs. Ars Comb. 93 (2009) - [j50]Evelyne Flandrin, Hao Li, Bing Wei
A sufficient condition for pancyclability of graphs. Discret. Math. 309(1): 144-150 (2009) - [j49]Guanghui Wang, Hao Li:
Color degree and alternating cycles in edge-colored graphs. Discret. Math. 309(13): 4349-4354 (2009) - [j48]Roman Cada
Hamiltonicity and pancyclicity of cartesian products of graphs. Discret. Math. 309(22): 6337-6343 (2009) - [c3]Li Liu, Hao Li, Junling Wang, Lian Li, Caihong Li:
Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks. FAW 2009: 251-260 - [c2]Li Liu, Bin Hu, Huifang Miao, Hao Li, Lian Li, Qinglin Zhao:
Achieving Energy Conservation, Coverage and Connectivity Requirements in Wireless Sensor Networks. ICDCS Workshops 2009: 227-232 - 2008
- [j47]Guanghui Wang, Hao Li:
Heterochromatic Matchings in Edge-Colored Graphs. Electron. J. Comb. 15(1) (2008) - [j46]Evelyne Flandrin, Tomás Kaiser
Neighborhood unions and extremal spanning trees. Discret. Math. 308(12): 2343-2350 (2008) - [j45]Hao Li, Jianping Li:
Long paths with endpoints in given vertex-subsets of graphs. Discret. Math. 308(19): 4518-4529 (2008) - [j44]Hao Li, Huifang Miao, Li Liu, Lian Li, Heping Zhang
Energy conservation in wireless sensor networks and connectivity of graphs. Theor. Comput. Sci. 393(1-3): 81-89 (2008) - 2007
- [j43]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): 878-884 (2007) - [j42]Hao Li, Evelyne Flandrin, Jinlong Shu:
A sufficient condition for cyclability in directed graphs. Discret. Math. 307(11-12): 1291-1297 (2007) - [j41]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A Chvátal-Erdos type condition for pancyclability. Discret. Math. 307(11-12): 1463-1466 (2007) - [j40]Tomás Kaiser
A Note on k -walks in Bridgeless Graphs. Graphs Comb. 23(3): 303-308 (2007) - [c1]Hao Li, Guanghui Wang, Shan Zhou:
Long Alternating Cycles in Edge-Colored Complete Graphs. FAW 2007: 305-309 - 2006
- [j39]Evelyne Flandrin, Hao Li, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak:
Chvátal-Erdös condition and pancyclism. Discuss. Math. Graph Theory 26(2): 335-342 (2006) - [j38]Evelyne Flandrin, Hao Li, Roman Cada
Hamiltonicity and pancyclicity of generalized prisms. Electron. Notes Discret. Math. 24: 61-67 (2006) - 2005
- [j37]Hao Li, Jinlong Shu:
The partition of a strong tournament. Discret. Math. 290(2/3): 211-220 (2005) - [j36]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A Note on a Generalisation of Ore's Condition. Graphs Comb. 21(2): 213-216 (2005) - 2004
- [j35]Hao Li, Jinlong Shu:
Partitioning a strong tournament into k cycles. Ars Comb. 72 (2004) - [j34]Roman Cada
Cycles through given vertices and closures. Discret. Math. 276(1-3): 65-80 (2004) - [j33]Hikoe Enomoto, Hao Li:
Partition of a graph into cycles and degenerated cycles. Discret. Math. 276(1-3): 177-181 (2004) - [j32]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A note on pancyclism of highly connected graphs. Discret. Math. 286(1-2): 57-60 (2004) - [j31]Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp:
Balanced edge colorings. J. Comb. Theory B 90(1): 3-20 (2004) - 2003
- [j30]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): 188-198 (2003) - 2001
- [j29]Mao-cheng Cai, Evelyne Flandrin, Hao Li:
On quasifactorability in graphs. Discret. Math. 233(1-3): 85-92 (2001) - [j28]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): 37-42 (2001) - [j27]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): 65-80 (2001) - [j26]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A note on a new condition implying pancyclism. Discuss. Math. Graph Theory 21(1): 137-143 (2001) - [j25]Guantao Chen, Ronald J. Gould, Hao Li:
Partitioning Vertices of a Tournament into Independent Cycles. J. Comb. Theory B 83(2): 213-220 (2001) - [j24]Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
Partitioning vertices of 1-tough graphs into paths. Theor. Comput. Sci. 263(1-2): 255-261 (2001) - 2000
- [j23]Amel Harkat-Benhamdine, Hao Li, Feng Tian:
Cyclability of 3-connected graphs. J. Graph Theory 34(3): 191-203 (2000) - [j22]Cristina Bazgan, Hao Li, Mariusz Wozniak:
On the Loebl-Komlós-Sós conjecture. J. Graph Theory 34(4): 269-276 (2000)
1990 – 1999
- 1999
- [j21]Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li, Zhenhong Liu:
On 2-factors in claw-free graphs. Discret. Math. 206(1-3): 131-137 (1999) - [j20]Odile Favaron, Evelyne Flandrin, Hao Li, Feng Tian:
An Ore-type condition for pancyclability. Discret. Math. 206(1-3): 139-144 (1999) - [j19]Mao-cheng Cai, Odile Favaron, Hao Li:
(2, k)-Factor-Critical Graphs and Toughness. Graphs Comb. 15(2): 137-142 (1999) - [j18]Chuanping Chen, Amel Harkat-Benhamdine, Hao Li:
Distance-Dominating Cycles in Quasi Claw-Free Graphs. Graphs Comb. 15(3): 279-285 (1999) - [j17]Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs. J. Comb. Theory B 75(2): 288-301 (1999) - 1998
- [j16]Hao Li, Mei Lu, Zhiren Sun:
Hamiltonicity in 2-connected graphs with claws. Discret. Math. 183(1-3): 223-236 (1998) - [j15]Ahmed Ainouche, Odile Favaron, Hao Li:
Global insertion and hamiltonicity in DCT-graphs. Discret. Math. 184(1-3): 1-13 (1998) - 1997
- [j14]Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Amel Harkat-Benhamdine, Hao Li:
Dlambda-cycles in lambda-claw-free graphs. Discret. Math. 165-166: 11-20 (1997) - [j13]Hao Li, Mei Lu, Feng Tian, Bing Wei:
Hamiltonicity of 2-connected claw-center independent graphs. Discret. Math. 165-166: 469-479 (1997) - [j12]Hajo Broersma
Cycles through subsets with large degree sums. Discret. Math. 171(1-3): 43-54 (1997) - 1996
- [j11]Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek:
Shortest walks in almost claw-free graphs. Ars Comb. 42 (1996) - [j10]Odile Favaron, Hao Li, Richard H. Schelp:
Strong edge colorings of graphs. Discret. Math. 159(1-3): 103-109 (1996) - [j9]Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li:
Pancyclism and small cycles in graphs. Discuss. Math. Graph Theory 16(1): 27-40 (1996) - [j8]Odile Favaron, Evelyne Flandrin, Hao Li, Yiping Liu, Feng Tian, Zhengsheng Wu:
Sequences, claws and cyclability of graphs. J. Graph Theory 21(4): 357-369 (1996) - 1995
- [j7]Daniel Barraez, Evelyne Flandrin, Hao Li, Oscar Ordaz:
Dominating cycles in bipartite biclaw-free graphs. Discret. Math. 146(1-3): 11-18 (1995) - 1994
- [j6]Evelyne Flandrin, Jean-Luc Fouquet, Hao Li:
Hamiltonicity of Bipartite Biclaw-free Graphs. Discret. Appl. Math. 51(1-2): 95-102 (1994) - [j5]Evelyne Flandrin, Hao Li:
Mengerian properties, hamiltonicity, and claw-free graphs. Networks 24(3): 177-183 (1994) - 1993
- [j4]Evelyne Flandrin, Jean-Luc Fouquet, Hao Li:
On hamiltonian claw-free graphs. Discret. Math. 111(1-3): 221-229 (1993) - [j3]Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li:
The complete closure of a graph. J. Graph Theory 17(4): 481-494 (1993) - 1991
- [j2]Evelyne Flandrin, Heinz Adolf Jung, Hao Li:
Hamiltonism, degree sum and neighborhood intersections. Discret. Math. 90(1): 41-52 (1991) - [j1]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): 313-317 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-15 02:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: