Shao, Yehong Essential edge connectivity of line graphs. (English) Zbl 1397.05134 Discrete Math. 341, No. 12, 3441-3446 (2018). MSC: 05C69 05C40 PDF BibTeX XML Cite \textit{Y. Shao}, Discrete Math. 341, No. 12, 3441--3446 (2018; Zbl 1397.05134) Full Text: DOI
Han, Miaomiao; Lai, Hong-Jian; Shao, Yehong The index problem of group connectivity. (English) Zbl 1367.05117 J. Comb. 8, No. 2, 305-321 (2017). MSC: 05C40 05C76 PDF BibTeX XML Cite \textit{M. Han} et al., J. Comb. 8, No. 2, 305--321 (2017; Zbl 1367.05117) Full Text: DOI
Lai, Hong-Jian; Shao, Yehong; Zhan, Mingquan \(K_5^-\)-factor in a graph. (English) Zbl 1363.05199 Ars Comb. 122, 97-124 (2015). MSC: 05C70 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., Ars Comb. 122, 97--124 (2015; Zbl 1363.05199)
Lai, Hong-Jian; Liang, Yanting; Liu, Juan; Meng, Jixiang; Miao, Zhengke; Shao, Yehong; Zhang, Zhao On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs. (English) Zbl 1297.05132 Discrete Appl. Math. 174, 73-80 (2014). MSC: 05C40 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., Discrete Appl. Math. 174, 73--80 (2014; Zbl 1297.05132) Full Text: DOI
Lai, Hong-Jian; Shao, Yehong On \(s\)-Hamiltonian line graphs. (English) Zbl 1276.05100 J. Graph Theory 74, No. 3-4, 344-358 (2013). MSC: 05C76 PDF BibTeX XML Cite \textit{H.-J. Lai} and \textit{Y. Shao}, J. Graph Theory 74, No. 3--4, 344--358 (2013; Zbl 1276.05100) Full Text: DOI
Zhao, Kewen; Zhang, Lili; Lai, Hong-Jian; Shao, Yehong Hamiltonian graphs involving neighborhood conditions. (English) Zbl 1274.05262 Ars Comb. 105, 161-170 (2012). Reviewer: Ralph Faudree (Memphis) MSC: 05C38 05C35 PDF BibTeX XML Cite \textit{K. Zhao} et al., Ars Comb. 105, 161--170 (2012; Zbl 1274.05262)
Lili, Zhang; Shao, Yehong; Chen, Guihai; Xu, Xinping; Zhou, Ju \(s\)-vertex pancyclic index. (English) Zbl 1256.05125 Graphs Comb. 28, No. 3, 393-406 (2012). MSC: 05C38 05C76 PDF BibTeX XML Cite \textit{Z. Lili} et al., Graphs Comb. 28, No. 3, 393--406 (2012; Zbl 1256.05125) Full Text: DOI
Li, Ping; Lai, Hong-Jian; Shao, Yehong; Zhan, Mingquan Spanning cycles in regular matroids without small cocircuits. (English) Zbl 1248.05030 Eur. J. Comb. 33, No. 8, 1765-1776 (2012). MSC: 05B35 PDF BibTeX XML Cite \textit{P. Li} et al., Eur. J. Comb. 33, No. 8, 1765--1776 (2012; Zbl 1248.05030) Full Text: DOI
Li, Xiangwen; Lai, Hong-Jian; Shao, Yehong Degree condition and \(Z_3\)-connectivity. (English) Zbl 1242.05146 Discrete Math. 312, No. 10, 1658-1669 (2012). MSC: 05C40 PDF BibTeX XML Cite \textit{X. Li} et al., Discrete Math. 312, No. 10, 1658--1669 (2012; Zbl 1242.05146) Full Text: DOI
Lai, Hong-Jian; Li, Hao; Shao, Yehong; Zhan, Mingquan On 3-edge-connected supereulerian graphs. (English) Zbl 1235.05084 Graphs Comb. 27, No. 2, 207-214 (2011). MSC: 05C45 05C40 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., Graphs Comb. 27, No. 2, 207--214 (2011; Zbl 1235.05084) Full Text: DOI
Lai, Hong-Jian; Lemos, Manoel; Reid, Talmage James; Shao, Yehong; Wu, Haidong Obstructions to a binary matroid being graphic. (English) Zbl 1229.05074 Eur. J. Comb. 32, No. 6, 853-860 (2011). MSC: 05B35 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., Eur. J. Comb. 32, No. 6, 853--860 (2011; Zbl 1229.05074) Full Text: DOI
Lai, Hong-Jian; Li, Xiangwen; Shao, Yehong; Zhan, Mingquan Group connectivity and group colorings of graphs — a survey. (English) Zbl 1233.05127 Acta Math. Sin., Engl. Ser. 27, No. 3, 405-434 (2011). MSC: 05C40 05C15 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., Acta Math. Sin., Engl. Ser. 27, No. 3, 405--434 (2011; Zbl 1233.05127) Full Text: DOI
Fan, Suohai; Lai, Hong-Jian; Shao, Yehong; Wu, Hehui; Zhou, Ju Regular matroids without disjoint circuits. (English) Zbl 1249.05047 Ars Comb. 97A, 153-159 (2010). MSC: 05B35 PDF BibTeX XML Cite \textit{S. Fan} et al., Ars Comb. 97A, 153--159 (2010; Zbl 1249.05047)
Lai, Hong-Jian; Li, Mingchu; Shao, Yehong; Xiong, Liming Spanning eulerian subgraphs in \(N^2\)-locally connected claw-free graphs. (English) Zbl 1240.05171 Ars Comb. 94, 191-199 (2010). MSC: 05C40 05C45 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., Ars Comb. 94, 191--199 (2010; Zbl 1240.05171)
Shao, Yehong Connectivity of iterated line graphs. (English) Zbl 1215.05097 Discrete Appl. Math. 158, No. 18, 2081-2087 (2010). MSC: 05C40 05C76 PDF BibTeX XML Cite \textit{Y. Shao}, Discrete Appl. Math. 158, No. 18, 2081--2087 (2010; Zbl 1215.05097) Full Text: DOI
Zhang, Xiaoxia; Zhan, Mingquan; Xu, Rui; Shao, Yehong; Li, Xiangwen; Lai, Hong-Jian Degree sum condition for \(Z_{3}\)-connectivity in graphs. (English) Zbl 1210.05028 Discrete Math. 310, No. 23, 3390-3397 (2010). MSC: 05C07 05C40 PDF BibTeX XML Cite \textit{X. Zhang} et al., Discrete Math. 310, No. 23, 3390--3397 (2010; Zbl 1210.05028) Full Text: DOI
Lai, Hong-Jian; Shao, Yehong; Yu, Gexin; Zhan, Mingquan Hamiltonian connectedness in 3-connected line graphs. (English) Zbl 1169.05344 Discrete Appl. Math. 157, No. 5, 982-990 (2009). MSC: 05C40 05C45 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., Discrete Appl. Math. 157, No. 5, 982--990 (2009; Zbl 1169.05344) Full Text: DOI
Catlin, Paul A.; Lai, Hong-Jian; Shao, Yehong Edge-connectivity and edge-disjoint spanning trees. (English) Zbl 1168.05039 Discrete Math. 309, No. 5, 1033-1040 (2009). Reviewer: William G. Brown (Montréal) MSC: 05C40 05C05 05C45 05C20 PDF BibTeX XML Cite \textit{P. A. Catlin} et al., Discrete Math. 309, No. 5, 1033--1040 (2009; Zbl 1168.05039) Full Text: DOI
Lai, Hong-Jian; Shao, Yehong; Wu, Hehui; Zhou, Ju On mod \((2p+1)\)-orientations of graphs. (English) Zbl 1184.05061 J. Comb. Theory, Ser. B 99, No. 2, 399-406 (2009). MSC: 05C25 05C20 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., J. Comb. Theory, Ser. B 99, No. 2, 399--406 (2009; Zbl 1184.05061) Full Text: DOI
Lai, Hong-Jian; Miao, Lianying; Shao, Yehong Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected. (English) Zbl 1189.05086 Eur. J. Comb. 30, No. 2, 595-601 (2009). Reviewer: Joseph B. Klerlein (MR 2009k:05101) MSC: 05C40 05C35 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., Eur. J. Comb. 30, No. 2, 595--601 (2009; Zbl 1189.05086) Full Text: DOI
Zhang, Lili; Hennayake, Kamal; Lai, Hong-Jian; Shao, Yehong A lower bound of the \(l\)-edge-connectivity and optimal graphs. (English) Zbl 1160.05039 J. Comb. Math. Comb. Comput. 66, 79-95 (2008). MSC: 05C40 05C35 PDF BibTeX XML Cite \textit{L. Zhang} et al., J. Comb. Math. Comb. Comput. 66, 79--95 (2008; Zbl 1160.05039)
Fan, Suohai; Lai, Hong-Jian; Shao, Yehong; Zhang, Taoye; Zhou, Ju Degree sequence and supereulerian graphs. (English) Zbl 1165.05005 Discrete Math. 308, No. 24, 6626-6631 (2008). MSC: 05C07 05C45 PDF BibTeX XML Cite \textit{S. Fan} et al., Discrete Math. 308, No. 24, 6626--6631 (2008; Zbl 1165.05005) Full Text: DOI
Lai, Hong-Jian; Shao, Yehong; Zhan, Mingquan Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected. (English) Zbl 1189.05096 Discrete Math. 308, No. 22, 5312-5316 (2008). MSC: 05C45 05C40 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., Discrete Math. 308, No. 22, 5312--5316 (2008; Zbl 1189.05096) Full Text: DOI
Lili, Zhang; Eschen, Elaine; Lai, Hong-Jian; Shao, Yehong The \(s\)-Hamiltonian index. (English) Zbl 1223.05166 Discrete Math. 308, No. 20, 4779-4785 (2008). MSC: 05C45 PDF BibTeX XML Cite \textit{Z. Lili} et al., Discrete Math. 308, No. 20, 4779--4785 (2008; Zbl 1223.05166) Full Text: DOI
Lai, Hong-Jian; Liang, Yanting; Shao, Yehong On \(s\)-Hamiltonian-connected line graphs. (English) Zbl 1177.05068 Discrete Math. 308, No. 18, 4293-4297 (2008). Reviewer: Linda Lesniak (Kalamazoo) MSC: 05C45 05C40 05C76 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., Discrete Math. 308, No. 18, 4293--4297 (2008; Zbl 1177.05068) Full Text: DOI
Dengxin, Li; Lai, Hong-Jian; Shao, Yehong; Zhan, Mingquan Hamiltonian connected hourglass free line graphs. (English) Zbl 1147.05045 Discrete Math. 308, No. 12, 2634-2636 (2008). MSC: 05C45 PDF BibTeX XML Cite \textit{L. Dengxin} et al., Discrete Math. 308, No. 12, 2634--2636 (2008; Zbl 1147.05045) Full Text: DOI
Lai, Hong-Jian; Liu, Bolian; Liu, Yan; Shao, Yehong Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors. (English) Zbl 1126.05031 Eur. J. Comb. 29, No. 1, 298-310 (2008). MSC: 05B35 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., Eur. J. Comb. 29, No. 1, 298--310 (2008; Zbl 1126.05031) Full Text: DOI
Zhao, Kewen; Lai, Hong-Jian; Shao, Yehong New sufficient condition for Hamiltonian graphs. (English) Zbl 1129.05027 Appl. Math. Lett. 20, No. 1, 116-122 (2007). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C45 PDF BibTeX XML Cite \textit{K. Zhao} et al., Appl. Math. Lett. 20, No. 1, 116--122 (2007; Zbl 1129.05027) Full Text: DOI
Lai, Hong-Jian; Shao, Yehong Some problems related to Hamiltonian line graphs. (English) Zbl 1408.05079 Chen, Zhijie (ed.) et al., Proceedings of the international conference on complex geometry and related fields, Shanghai, China, 2004. Providence, RI: American Mathematical Society (AMS); Somerville, MA: International Press. AMS/IP Stud. Adv. Math. 39, 149-159 (2007). MSC: 05C45 05C38 05C76 PDF BibTeX XML Cite \textit{H.-J. Lai} and \textit{Y. Shao}, AMS/IP Stud. Adv. Math. 39, 149--159 (2007; Zbl 1408.05079)
Chen, Zhi-Hong; Lai, Hong-Jian; Luo, Weiqi; Shao, Yehong Spanning Eulerian subgraphs in claw-free graphs. (English) Zbl 1124.05054 J. Comb. Math. Comb. Comput. 59, 165-171 (2006). Reviewer: Reinhardt Euler (Brest) MSC: 05C45 PDF BibTeX XML Cite \textit{Z.-H. Chen} et al., J. Comb. Math. Comb. Comput. 59, 165--171 (2006; Zbl 1124.05054)
Lai, Hong-Jian; Shao, Yehong; Wu, Hehui; Zhou, Ju Every 3-connected, essentially 11-connected line graph is Hamiltonian. (English) Zbl 1091.05040 J. Comb. Theory, Ser. B 96, No. 4, 571-576 (2006). MSC: 05C45 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., J. Comb. Theory, Ser. B 96, No. 4, 571--576 (2006; Zbl 1091.05040) Full Text: DOI
Lai, Hong-Jian; Shao, Yehong; Zhan, Mingquan Hamiltonicity in 3-connected claw-free graphs. (English) Zbl 1095.05024 J. Comb. Theory, Ser. B 96, No. 4, 493-504 (2006). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C45 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., J. Comb. Theory, Ser. B 96, No. 4, 493--504 (2006; Zbl 1095.05024) Full Text: DOI
Lai, Hong-Jian; Shao, Yehong; Zhou, Ju; Wu, Hehui Every 3-connected, essentially 11-connected line graph is Hamiltonian. (English) Zbl 1192.05129 Felsner, Stefan (ed.), 2005 European conference on combinatorics, graph theory and applications (EuroComb ’05). Extended abstracts from the conference, Technische Universität Berlin, Berlin, Germany, September 5–9, 2005. Paris: Maison de l’Informatique et des Mathématiques Discrètes (MIMD). Discrete Mathematics & Theoretical Computer Science. Proceedings. AE, 379-382, electronic only (2005). MSC: 05C76 05C45 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., in: 2005 European conference on combinatorics, graph theory and applications (EuroComb '05). Extended abstracts from the conference, Technische Universität Berlin, Berlin, Germany, September 5--9, 2005. Paris: Maison de l'Informatique et des Mathématiques Discrètes (MIMD). 379--382 (2005; Zbl 1192.05129) Full Text: Link
Lai, Hong-Jian; Shao, Yehong; Zhan, Mingquan Hamiltonian \(N_{2}\)-locally connected claw-free graphs. (English) Zbl 1060.05061 J. Graph Theory 48, No. 2, 142-146 (2005). MSC: 05C40 05C45 PDF BibTeX XML Cite \textit{H.-J. Lai} et al., J. Graph Theory 48, No. 2, 142--146 (2005; Zbl 1060.05061) Full Text: DOI
Xu, Min; Shao, Yehong A new result on \(s\)-traceable graphs. (Chinese. English summary) Zbl 1001.05076 J. Nanjing Norm. Univ., Nat. Sci. Ed. 25, No. 1, 7-14 (2002). MSC: 05C45 PDF BibTeX XML Cite \textit{M. Xu} and \textit{Y. Shao}, J. Nanjing Norm. Univ., Nat. Sci. Ed. 25, No. 1, 7--14 (2002; Zbl 1001.05076)
Shao, Yehong; Xu, Min A sufficient condition for \(s\)-Hamilton-connected graphs. (Chinese. English summary) Zbl 0992.05053 J. Nanjing Norm. Univ., Nat. Sci. Ed. 24, No. 4, 7-11 (2001). MSC: 05C45 PDF BibTeX XML Cite \textit{Y. Shao} and \textit{M. Xu}, J. Nanjing Norm. Univ., Nat. Sci. Ed. 24, No. 4, 7--11 (2001; Zbl 0992.05053)