Dai, Tianjiao; Li, Hao; Ouyang, Qiancheng; Tian, Zengxian On \((2, k)\)-Hamilton-connected graphs. (English) Zbl 07782001 Discrete Appl. Math. 343, 288-299 (2024). MSC: 05C45 05C40 05C07 05C75 PDFBibTeX XMLCite \textit{T. Dai} et al., Discrete Appl. Math. 343, 288--299 (2024; Zbl 07782001) Full Text: DOI
Hu, Jie; Li, Hao; Maezawa, Shun-ichi Maximum properly colored trees in edge-colored graphs. (English) Zbl 1498.90240 J. Comb. Optim. 44, No. 1, 154-171 (2022). MSC: 90C35 90C27 05C15 PDFBibTeX XMLCite \textit{J. Hu} et al., J. Comb. Optim. 44, No. 1, 154--171 (2022; Zbl 1498.90240) Full Text: DOI
Jiang, Suyun; Li, Hao; Yan, Jin Vertex-disjoint stars in \(K_{1 , r}\)-free graphs. (English) Zbl 1469.05116 Discrete Appl. Math. 302, 189-197 (2021). MSC: 05C60 05C07 05C35 PDFBibTeX XMLCite \textit{S. Jiang} et al., Discrete Appl. Math. 302, 189--197 (2021; Zbl 1469.05116) Full Text: DOI
Hu, Jie; Li, Hao; Yang, Donglei Vertex-disjoint rainbow triangles in edge-colored graphs. (English) Zbl 1448.05075 Discrete Math. 343, No. 12, Article ID 112117, 5 p. (2020). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Hu} et al., Discrete Math. 343, No. 12, Article ID 112117, 5 p. (2020; Zbl 1448.05075) Full Text: DOI
Cai, Junqing; Li, Hao; Zhang, Yuzhong An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian. (English) Zbl 1476.05100 Inf. Process. Lett. 134, 9-13 (2018). MSC: 05C45 05C07 05C40 PDFBibTeX XMLCite \textit{J. Cai} et al., Inf. Process. Lett. 134, 9--13 (2018; Zbl 1476.05100) Full Text: DOI
Cai, Junqing; Flandrin, Evelyne; Li, Hao; Sun, Qiang Spanning trees with a bounded number of leaves. (English) Zbl 1397.05039 Opusc. Math. 37, No. 4, 501-508 (2017). MSC: 05C07 05C05 PDFBibTeX XMLCite \textit{J. Cai} et al., Opusc. Math. 37, No. 4, 501--508 (2017; Zbl 1397.05039) Full Text: DOI
Chen, Ai-lian; Li, Hao; Zhang, Fu-ji The maximum and minimum degree of the random \(r\)-uniform \(r\)-partite hypergraphs. (English) Zbl 1358.05254 Acta Math. Appl. Sin., Engl. Ser. 32, No. 4, 867-874 (2016). MSC: 05C80 05C65 05C70 PDFBibTeX XMLCite \textit{A.-l. Chen} et al., Acta Math. Appl. Sin., Engl. Ser. 32, No. 4, 867--874 (2016; Zbl 1358.05254) Full Text: DOI
Cai, Junqing; Li, Hao Hamilton cycles in implicit 2-heavy graphs. (English) Zbl 1342.05080 Graphs Comb. 32, No. 4, 1329-1337 (2016). MSC: 05C45 05C70 PDFBibTeX XMLCite \textit{J. Cai} and \textit{H. Li}, Graphs Comb. 32, No. 4, 1329--1337 (2016; Zbl 1342.05080) Full Text: DOI
Faudree, Ralph J.; Li, Hao; Yoshimoto, Kiyoshi Locating sets of vertices on Hamiltonian cycles. (English) Zbl 1339.05215 Discrete Appl. Math. 209, 107-114 (2016). MSC: 05C45 05C07 05C35 PDFBibTeX XMLCite \textit{R. J. Faudree} et al., Discrete Appl. Math. 209, 107--114 (2016; Zbl 1339.05215) Full Text: DOI
Cai, Jun-qing; Li, Hao An implicit degree condition for relative length of long paths and cycles in graphs. (English) Zbl 1336.05071 Acta Math. Appl. Sin., Engl. Ser. 32, No. 2, 365-372 (2016). MSC: 05C38 05C45 05C12 PDFBibTeX XMLCite \textit{J.-q. Cai} and \textit{H. Li}, Acta Math. Appl. Sin., Engl. Ser. 32, No. 2, 365--372 (2016; Zbl 1336.05071) Full Text: DOI
Cai, Junqing; Li, Hao; Ning, Wantao An implicit weighted degree condition for heavy cycles. (English) Zbl 1303.05106 Discuss. Math., Graph Theory 34, No. 4, 801-810 (2014). MSC: 05C45 05C38 05C22 05C07 PDFBibTeX XMLCite \textit{J. Cai} et al., Discuss. Math., Graph Theory 34, No. 4, 801--810 (2014; Zbl 1303.05106) Full Text: DOI
Yang, Weihua; Tian, Yingzhi; Li, Hengzhe; Li, Hao; Guo, Xiaofeng The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree. (English) Zbl 1284.05065 Discrete Appl. Math. 167, 304-309 (2014). MSC: 05C05 05C35 05C40 PDFBibTeX XMLCite \textit{W. Yang} et al., Discrete Appl. Math. 167, 304--309 (2014; Zbl 1284.05065) Full Text: DOI
Cai, Junqing; Li, Hao; Ning, Wantao An implicit degree condition for Hamiltonian cycles. (English) Zbl 1289.05254 Ars Comb. 108, 365-378 (2013). MSC: 05C45 05C07 PDFBibTeX XMLCite \textit{J. Cai} et al., Ars Comb. 108, 365--378 (2013; Zbl 1289.05254)
Li, Hao Generalizations of Dirac’s theorem in Hamiltonian graph theory – a survey. (English) Zbl 1277.05100 Discrete Math. 313, No. 19, 2034-2053 (2013). MSC: 05C45 05C38 PDFBibTeX XMLCite \textit{H. Li}, Discrete Math. 313, No. 19, 2034--2053 (2013; Zbl 1277.05100) Full Text: DOI
Li, Hao Rainbow \(C_3\)’s and \(C_4\)’s in edge-colored graphs. (English) Zbl 1277.05065 Discrete Math. 313, No. 19, 1893-1896 (2013). MSC: 05C15 05C20 05C60 05C35 PDFBibTeX XMLCite \textit{H. Li}, Discrete Math. 313, No. 19, 1893--1896 (2013; Zbl 1277.05065) Full Text: DOI
Li, Hao; Cai, Jun Qing An implicit degree Ore-condition for pancyclicity of graphs. (English) Zbl 1277.05092 Acta Math. Sin., Engl. Ser. 29, No. 9, 1773-1780 (2013). MSC: 05C38 05C45 PDFBibTeX XMLCite \textit{H. Li} and \textit{J. Q. Cai}, Acta Math. Sin., Engl. Ser. 29, No. 9, 1773--1780 (2013; Zbl 1277.05092) Full Text: DOI
Li, Hao; Cai, Junqing; Ning, Wantao An implicit degree condition for pancyclicity of graphs. (English) Zbl 1272.05104 Graphs Comb. 29, No. 5, 1459-1469 (2013). MSC: 05C45 PDFBibTeX XMLCite \textit{H. Li} et al., Graphs Comb. 29, No. 5, 1459--1469 (2013; Zbl 1272.05104) Full Text: DOI
Chen, Ai Lian; Zhang, Fu Ji; Li, Hao The degree distribution of the random multigraphs. (English) Zbl 1268.05177 Acta Math. Sin., Engl. Ser. 28, No. 5, 941-956 (2012). MSC: 05C80 05C07 PDFBibTeX XMLCite \textit{A. L. Chen} et al., Acta Math. Sin., Engl. Ser. 28, No. 5, 941--956 (2012; Zbl 1268.05177) Full Text: DOI
Wang, Guanghui; Li, Hao; Zhu, Yan; Liu, Guizhen A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs. (English) Zbl 1256.05080 Graphs Comb. 28, No. 6, 901-905 (2012). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{G. Wang} et al., Graphs Comb. 28, No. 6, 901--905 (2012; Zbl 1256.05080) Full Text: DOI
Faudree, Ralph J.; Li, Hao Locating pairs of vertices on Hamiltonian cycles. (English) Zbl 1245.05079 Discrete Math. 312, No. 17, 2700-2706 (2012). MSC: 05C45 05C35 05C07 PDFBibTeX XMLCite \textit{R. J. Faudree} and \textit{H. Li}, Discrete Math. 312, No. 17, 2700--2706 (2012; Zbl 1245.05079) Full Text: DOI
Chen, Guantao; Hu, Zhiquan; Li, Hao Endpoint extendable paths in dense graphs. (English) Zbl 1246.05085 Discrete Math. 312, No. 17, 2584-2592 (2012). MSC: 05C38 05C42 05C40 PDFBibTeX XMLCite \textit{G. Chen} et al., Discrete Math. 312, No. 17, 2584--2592 (2012; Zbl 1246.05085) Full Text: DOI
Li, Hao; Ning, Wantao; Cai, Junqing An implicit degree condition for Hamiltonian graphs. (English) Zbl 1244.05137 Discrete Math. 312, No. 14, 2190-2196 (2012). MSC: 05C45 05C40 05C07 05C69 PDFBibTeX XMLCite \textit{H. Li} et al., Discrete Math. 312, No. 14, 2190--2196 (2012; Zbl 1244.05137) Full Text: DOI
Chen, Ailian; Zhang, Fuji; Li, Hao The maximum and minimum degrees of random bipartite multigraphs. (English) Zbl 1240.05273 Acta Math. Sci., Ser. B, Engl. Ed. 31, No. 3, 1155-1166 (2011). MSC: 05C80 PDFBibTeX XMLCite \textit{A. Chen} et al., Acta Math. Sci., Ser. B, Engl. Ed. 31, No. 3, 1155--1166 (2011; Zbl 1240.05273) Full Text: DOI
Li, Hao; Ning, Wantao; Cai, Junqing An implicit degree condition for cyclability in graphs. (English) Zbl 1329.05164 Atallah, Mikhail (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2011, Jinhua, China, May 28–31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21203-1/pbk). Lecture Notes in Computer Science 6681, 82-89 (2011). MSC: 05C38 PDFBibTeX XMLCite \textit{H. Li} et al., Lect. Notes Comput. Sci. 6681, 82--89 (2011; Zbl 1329.05164) Full Text: DOI
Li, Hao; Wozniak, Mariusz A note on graphs containing all trees of a given size. (English) Zbl 1240.05046 Ars Comb. 94, 517-520 (2010). Reviewer: Roman Čada (Plzeň) MSC: 05C05 PDFBibTeX XMLCite \textit{H. Li} and \textit{M. Wozniak}, Ars Comb. 94, 517--520 (2010; Zbl 1240.05046)
Li, H.; Nikiforov, V.; Schelp, R. H. A new class of Ramsey-Turán problems. (English) Zbl 1203.05101 Discrete Math. 310, No. 24, 3579-3583 (2010). Reviewer: Ralph Faudree (Memphis) MSC: 05C55 05D10 PDFBibTeX XMLCite \textit{H. Li} et al., Discrete Math. 310, No. 24, 3579--3583 (2010; Zbl 1203.05101) Full Text: DOI arXiv
Zhou, Shan; Li, Hao; Wang, Guanghui Algorithm for two disjoint long paths in 2-connected graphs. (English) Zbl 1209.05133 Theor. Comput. Sci. 411, No. 34-36, 3247-3254 (2010). MSC: 05C38 05C85 05C40 PDFBibTeX XMLCite \textit{S. Zhou} et al., Theor. Comput. Sci. 411, No. 34--36, 3247--3254 (2010; Zbl 1209.05133) Full Text: DOI
Wang, Guanghui; Li, Hao Color degree and alternating cycles in edge-colored graphs. (English) Zbl 1198.05070 Discrete Math. 309, No. 13, 4349-4354 (2009). Reviewer: Ulrike Baumann (Dresden) MSC: 05C15 05C38 05C45 PDFBibTeX XMLCite \textit{G. Wang} and \textit{H. Li}, Discrete Math. 309, No. 13, 4349--4354 (2009; Zbl 1198.05070) Full Text: DOI
Hu, Zhiquan; Li, Hao Weak cycle partition involving degree sum conditions. (English) Zbl 1170.05038 Discrete Math. 309, No. 4, 647-654 (2009). Reviewer: Dalibor Fronček (Duluth) MSC: 05C38 05C70 PDFBibTeX XMLCite \textit{Z. Hu} and \textit{H. Li}, Discrete Math. 309, No. 4, 647--654 (2009; Zbl 1170.05038) Full Text: DOI
Li, Hao; Wang, Guanghui Color degree and heterochromatic matchings in edge-colored bipartite graphs. (English) Zbl 1161.05060 Util. Math. 77, 145-154 (2008). MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{H. Li} and \textit{G. Wang}, Util. Math. 77, 145--154 (2008; Zbl 1161.05060)
Li, Hao; Wang, Guanghui; Zhou, Shan Long alternating cycles in edge-colored complete graphs. (English) Zbl 1214.05059 Preparata, Franco P. (ed.) et al., Frontiers in algorithmics. First annual international workshop, FAW 2007, Lanzhou, China, August 1–3, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73813-8). Lecture Notes in Computer Science 4613, 305-309 (2007). MSC: 05C38 05C15 PDFBibTeX XMLCite \textit{H. Li} et al., Lect. Notes Comput. Sci. 4613, 305--309 (2007; Zbl 1214.05059) Full Text: DOI
Kaiser, Tomáš; Kužel, Roman; Li, Hao; Wang, Guanghui A note on \(k\)-walks in bridgeless graphs. (English) Zbl 1124.05055 Graphs Comb. 23, No. 3, 303-308 (2007). MSC: 05C45 PDFBibTeX XMLCite \textit{T. Kaiser} et al., Graphs Comb. 23, No. 3, 303--308 (2007; Zbl 1124.05055) Full Text: DOI
Hu, Zhiquan; Li, Hao Partition of a graph into cycles and vertices. (English) Zbl 1115.05073 Discrete Math. 307, No. 11-12, 1436-1440 (2007). MSC: 05C70 PDFBibTeX XMLCite \textit{Z. Hu} and \textit{H. Li}, Discrete Math. 307, No. 11--12, 1436--1440 (2007; Zbl 1115.05073) Full Text: DOI
Li, Hao; Flandrin, Evelyne; Shu, Jinlong A sufficient condition for cyclability in directed graphs. (English) Zbl 1115.05053 Discrete Math. 307, No. 11-12, 1291-1297 (2007). MSC: 05C45 05C20 05C38 PDFBibTeX XMLCite \textit{H. Li} et al., Discrete Math. 307, No. 11--12, 1291--1297 (2007; Zbl 1115.05053) Full Text: DOI
Čada, Roman; Flandrin, Evelyne; Li, Hao; Ryjáček, Zdeněk Cycles through given vertices and closures. (English) Zbl 1031.05072 Discrete Math. 276, No. 1-3, 65-80 (2004). MSC: 05C38 05C45 PDFBibTeX XMLCite \textit{R. Čada} et al., Discrete Math. 276, No. 1--3, 65--80 (2004; Zbl 1031.05072) Full Text: DOI
Egawa, Yoshimi; Enomoto, Hikoe; Faudree, Ralph J.; Li, Hao; Schiermeyer, Ingo Two-factors each component of which contains a specified vertex. (English) Zbl 1024.05073 J. Graph Theory 43, No. 3, 188-198 (2003). Reviewer: L.Lesniak (Madison) MSC: 05C70 05C45 PDFBibTeX XMLCite \textit{Y. Egawa} et al., J. Graph Theory 43, No. 3, 188--198 (2003; Zbl 1024.05073) Full Text: DOI
Li, H.; Li, Jianping Independent triangles covering given vertices of a graph. (English) Zbl 0972.05039 Theor. Comput. Sci. 263, No. 1-2, 333-344 (2001). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{H. Li} and \textit{J. Li}, Theor. Comput. Sci. 263, No. 1--2, 333--344 (2001; Zbl 0972.05039) Full Text: DOI
Cai, Maocheng; Flandrin, Evelyne; Li, Hao On quasifactorability in graphs. (English) Zbl 0985.05034 Discrete Math. 233, No. 1-3, 85-92 (2001). MSC: 05C70 PDFBibTeX XMLCite \textit{M. Cai} et al., Discrete Math. 233, No. 1--3, 85--92 (2001; Zbl 0985.05034) Full Text: DOI
Broersma, Hajo; Li, Hao; Li, Jianping; Tian, Feng; Veldman, Henk Jan Cycles through subsets with large degree sums. (English) Zbl 0883.05089 Discrete Math. 171, No. 1-3, 43-54 (1997). Reviewer: J.Bang-Jensen (Odense) MSC: 05C38 05C45 05C35 PDFBibTeX XMLCite \textit{H. Broersma} et al., Discrete Math. 171, No. 1--3, 43--54 (1997; Zbl 0883.05089) Full Text: DOI
Bang-Jensen, Jørgen; Gutin, Gregory; Li, Hao Sufficient conditions for a digraph to be hamiltonian. (English) Zbl 0854.05067 J. Graph Theory 22, No. 2, 181-187 (1996). Reviewer: R.Faudree (Memphis) MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 22, No. 2, 181--187 (1996; Zbl 0854.05067) Full Text: DOI
Flandrin, E.; Jung, H. A.; Li, H. Hamiltonism, degree sum and neighborhood intersections. (English) Zbl 0746.05038 Discrete Math. 90, No. 1, 41-52 (1991). Reviewer: C.Thomassen (Lyngby) MSC: 05C45 PDFBibTeX XMLCite \textit{E. Flandrin} et al., Discrete Math. 90, No. 1, 41--52 (1991; Zbl 0746.05038) Full Text: DOI