☰

Hong-Jian Lai - Publications

Affiliations: 
West Virginia University, Morgantown, WV, United States 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

189 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Hong Z, Lai H, Xia Z. Connectivity and eigenvalues of graphs with given girth or clique number Linear Algebra and Its Applications. 607: 319-340. DOI: 10.1016/J.Laa.2020.08.015  0.594
2020 Liu F, Wang W, Yu T, Lai H. Generalized cospectral graphs with and without Hamiltonian cycles Linear Algebra and Its Applications. 585: 199-208. DOI: 10.1016/J.Laa.2019.10.001  0.677
2020 Liu J, Li P, Li J, Lai H. On weighted modulo orientation of graphs European Journal of Combinatorics. 89: 103163. DOI: 10.1016/J.Ejc.2020.103163  0.582
2020 Han M, Lai H, Li J, Wu Y. Contractible graphs for flow index less than three Discrete Mathematics. 343: 112073. DOI: 10.1016/J.Disc.2020.112073  0.674
2020 Xu L, Lai H, Tian Y. On the extremal sizes of maximal graphs without (k+1)-connected subgraphs Discrete Applied Mathematics. 285: 397-406. DOI: 10.1016/J.Dam.2020.06.003  0.642
2020 Chen Y, Fan S, Lai H, Song H, Xu M. Decomposition and r-hued Coloring of K4(7)-minor free graphs Applied Mathematics and Computation. 384: 125206. DOI: 10.1016/J.Amc.2020.125206  0.547
2020 Xu L, Tian Y, Lai H. On the sizes of bi- k -maximal graphs Journal of Combinatorial Optimization. 39: 859-873. DOI: 10.1007/S10878-020-00522-2  0.573
2020 Algefari MJ, Lai H. Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree Graphs and Combinatorics. 1-10. DOI: 10.1007/S00373-020-02229-X  0.682
2020 Liu M, Wu Y, Lai H. Unified Spectral Hamiltonian Results of Balanced Bipartite Graphs and Complementary Graphs Graphs and Combinatorics. 36: 1363-1390. DOI: 10.1007/S00373-020-02200-W  0.605
2019 Hong Z, Xia Z, Lai H. Vertex-connectivity and eigenvalues of graphs Linear Algebra and Its Applications. 579: 72-88. DOI: 10.1016/J.Laa.2019.05.030  0.618
2019 Liu R, Lai H, Tian Y. Spanning tree packing number and eigenvalues of graphs with given girth Linear Algebra and Its Applications. 578: 411-424. DOI: 10.1016/J.Laa.2019.05.022  0.655
2019 He S, Hao R, Lai H. Bounds for the matching number and cyclomatic number of a signed graph in terms of rank Linear Algebra and Its Applications. 572: 273-291. DOI: 10.1016/J.Laa.2019.03.012  0.673
2019 Lai H, Zhan M, Zhang T, Zhou J. On s-hamiltonian line graphs of claw-free graphs Discrete Mathematics. 342: 3006-3016. DOI: 10.1016/J.Disc.2019.06.006  0.819
2019 Lai H, Lv X, Xu M. On r-hued colorings of graphs without short induced paths Discrete Mathematics. 342: 1904-1911. DOI: 10.1016/J.Disc.2019.03.017  0.627
2019 Liu M, Lai H, Das KC. Spectral results on Hamiltonian problem Discrete Mathematics. 342: 1718-1730. DOI: 10.1016/J.Disc.2019.02.016  0.559
2019 Tian Y, Lai H, Xu L, Meng J. Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs Discrete Mathematics. 342: 344-351. DOI: 10.1016/J.Disc.2018.10.001  0.486
2019 Lai H, Li J. Packing spanning trees in highly essentially connected graphs Discrete Mathematics. 342: 1-9. DOI: 10.1016/J.Disc.2018.09.005  0.705
2019 Gu R, Lai H, Liang Y, Miao Z, Zhang M. Collapsible subgraphs of a 4-edge-connected graph Discrete Applied Mathematics. 260: 272-277. DOI: 10.1016/J.Dam.2019.01.033  0.785
2019 Han M, Lai H, Liu J. Modulo 5-orientations and degree sequences Discrete Applied Mathematics. 260: 155-163. DOI: 10.1016/J.Dam.2019.01.021  0.487
2019 Liu R, Lai H, Tian Y, Wu Y. Vertex-connectivity and eigenvalues of graphs with fixed girth Applied Mathematics and Computation. 141-149. DOI: 10.1016/J.Amc.2018.09.053  0.58
2019 Wei J, You Z, Lai H. Spectral analogues of Erdős’ theorem on Hamilton-connected graphs Applied Mathematics and Computation. 340: 242-250. DOI: 10.1016/J.Amc.2018.08.005  0.596
2019 Tian Y, Lai H, Meng J. On the Sizes of Vertex- k -Maximal r -Uniform Hypergraphs Graphs and Combinatorics. 35: 1001-1010. DOI: 10.1007/S00373-019-02052-Z  0.384
2018 Li J, Hou X, Han M, Lai H. Mod $(2p+1)$-Orientation on Bipartite Graphs and Complementary Graphs Siam Journal On Discrete Mathematics. 32: 29-43. DOI: 10.1137/16M106889X  0.604
2018 Wu T, Lai H. On the permanental nullity and matching number of graphs Linear & Multilinear Algebra. 66: 516-524. DOI: 10.1080/03081087.2017.1302403  0.703
2018 Li X, Lei L, Lai H. The connectivity of generalized graph products Information Processing Letters. 136: 37-40. DOI: 10.1016/J.Ipl.2018.03.014  0.486
2018 Liu J, Yu A, Wang K, Lai H. Degree sum and hamiltonian-connected line graphs Discrete Mathematics. 341: 1363-1379. DOI: 10.1016/J.Disc.2018.02.008  0.67
2018 Song H, Lai H, Wu J. List r-hued chromatic number of graphs with bounded maximum average degrees Discrete Mathematics. 341: 1244-1252. DOI: 10.1016/J.Disc.2018.01.002  0.474
2018 Gu X, Lai H. A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs Discrete Mathematics. 341: 400-404. DOI: 10.1016/J.Disc.2017.09.007  0.535
2018 Han M, Lai H, Li J. Modulo orientations with bounded independence number Discrete Applied Mathematics. 247: 14-22. DOI: 10.1016/J.Dam.2018.01.016  0.586
2018 Song H, Lai H. Upper bounds of r-hued colorings of planar graphs Discrete Applied Mathematics. 243: 262-269. DOI: 10.1016/J.Dam.2017.12.041  0.547
2018 Cheng J, Lai H, Lorenzen KJ, Luo R, Thompson JC, Zhang C. r-hued coloring of sparse graphs Discrete Applied Mathematics. 237: 75-81. DOI: 10.1016/J.Dam.2017.11.033  0.63
2018 Algefari MJ, Lai H, Xu J. Locally dense supereulerian digraphs Discrete Applied Mathematics. 238: 24-31. DOI: 10.1016/J.Dam.2017.11.030  0.382
2018 Wu T, Lai H. On the permanental sum of graphs Applied Mathematics and Computation. 331: 334-340. DOI: 10.1016/J.Amc.2018.03.026  0.69
2018 Lai H, Zhan M, Zhang T, Zhou J. Pancyclicity of 4-Connected $$\{K_{1,3},Z_8\}$$-Free Graphs Graphs and Combinatorics. 35: 67-89. DOI: 10.1007/S00373-018-1987-4  0.793
2018 Wu T, Lai H. Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral Graphs and Combinatorics. 34: 1713-1721. DOI: 10.1007/S00373-018-1963-Z  0.592
2018 Zhang X, Liu J, Wang L, Lai H. Supereulerian bipartite digraphs Journal of Graph Theory. 89: 64-75. DOI: 10.1002/Jgt.22240  0.581
2018 Han M, Lai H, Li J. Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees Journal of Graph Theory. 88: 577-591. DOI: 10.1002/Jgt.22231  0.591
2017 Han M, Lai H, Shao Y. The index problem of group connectivity The Journal of Combinatorics. 8: 305-321. DOI: 10.4310/Joc.2017.V8.N2.A4  0.464
2017 Li J, Lai H, Luo R. Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees Siam Journal On Discrete Mathematics. 31: 1909-1922. DOI: 10.1137/16M1055189  0.566
2017 Chen Z, Lai H, Xiong L. Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs Journal of Combinatorial Theory, Series B. 122: 167-186. DOI: 10.1016/J.Jctb.2016.05.009  0.524
2017 Tian Y, Meng J, Lai H, Xu L. Connectivity keeping stars or double-stars in 2-connected graphs Discrete Mathematics. 341: 1120-1124. DOI: 10.1016/J.Disc.2017.10.017  0.523
2017 Xiong W, Xu J, Miao Z, Wu Y, Lai H. Supereulerian width of dense graphs Discrete Mathematics. 340: 2995-3001. DOI: 10.1016/J.Disc.2017.07.015  0.706
2017 Li H, Lai H, Wu Y, Zhu S. Panconnected index of graphs Discrete Mathematics. 340: 1092-1097. DOI: 10.1016/J.Disc.2016.10.015  0.647
2017 Chen ZH, Lai HJ, Zhang M. Spanning trails with variations of Chvátal–Erdős conditions Discrete Mathematics. 340: 243-251. DOI: 10.1016/J.Disc.2016.08.002  0.629
2017 Li H, Lai H. 3-dynamic coloring and list 3-dynamic coloring of K1,3-free graphs Discrete Applied Mathematics. 222: 166-171. DOI: 10.1016/J.Dam.2017.01.006  0.568
2017 Anderson J, Lai H, Lin X, Xu M. On k‐Maximal Strength Digraphs Journal of Graph Theory. 84: 17-25. DOI: 10.1002/Jgt.22008  0.492
2016 Alsatami KA, Zhang X, Liu J, Lai H. On a Class of Supereulerian Digraphs Applied Mathematics-a Journal of Chinese Universities Series B. 7: 320-326. DOI: 10.4236/Am.2016.73029  0.366
2016 Liu M, Das KC, Lai HJ. The (signless) Laplacian spectral radii of c-cyclic graphs with n vertices, girth g and k pendant vertices Linear and Multilinear Algebra. 1-13. DOI: 10.1080/03081087.2016.1211082  0.619
2016 Algefari MJ, Alsatami KA, Lai HJ, Liu J. Supereulerian digraphs with given local structures Information Processing Letters. 116: 321-326. DOI: 10.1016/J.Ipl.2015.12.008  0.564
2016 Lin X, Fan S, Lai HJ, Xu M. On the lower bound of k-maximal digraphs Discrete Mathematics. 339: 2500-2510. DOI: 10.1016/J.Disc.2016.04.007  0.399
2016 Hong Y, Liu Q, Lai HJ. Ore-type degree condition of supereulerian digraphs Discrete Mathematics. 339: 2042-2050. DOI: 10.1016/J.Disc.2016.03.015  0.332
2016 Miao L, Lai H, Guo Y, Miao Z. Element deletion changes in dynamic coloring of graphs Discrete Mathematics. 339: 1600-1604. DOI: 10.1016/J.Disc.2016.01.009  0.622
2016 Yu A, Liu J, Han M, Lai HJ. On dense strongly Z2s+1-connected graphs Discrete Mathematics. 339: 850-856. DOI: 10.1016/J.Disc.2015.10.033  0.612
2016 Hong Y, Gu X, Lai H, Liu Q. Fractional spanning tree packing, forest covering and eigenvalues Discrete Applied Mathematics. 213: 219-223. DOI: 10.1016/J.Dam.2016.04.027  0.761
2016 Ma X, Lai HJ, Xiong W, Wu B, An X. Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs Discrete Applied Mathematics. 202: 111-130. DOI: 10.1016/J.Dam.2015.07.043  0.693
2016 Li P, Li H, Chen Y, Fleischner H, Lai HJ. Supereulerian graphs with width s and s-collapsible graphs Discrete Applied Mathematics. 200: 79-94. DOI: 10.1016/J.Dam.2015.07.013  0.712
2016 Zhang ZK, Lai HJ. Characterizations of k-cutwidth critical trees Journal of Combinatorial Optimization. 1-12. DOI: 10.1007/S10878-016-0061-5  0.637
2016 Algefari MJ, Lai HJ. Supereulerian digraphs with large arc-strong connectivity Journal of Graph Theory. 81: 393-402. DOI: 10.1002/Jgt.21885  0.326
2016 Hou X, Lai HJ, Zhang CQ. On Perfect Matching Coverings and Even Subgraph Coverings Journal of Graph Theory. 81: 83-91. DOI: 10.1002/Jgt.21863  0.708
2016 Gu X, Lai HJ, Li P, Yao S. Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs Journal of Graph Theory. 81: 16-29. DOI: 10.1002/Jgt.21857  0.764
2015 Zhang H, Wu T, Lai H. Per-spectral characterizations of some edge-deleted subgraphs of a complete graph Linear & Multilinear Algebra. 63: 397-410. DOI: 10.1080/03081087.2013.869592  0.615
2015 Song H, Lai HJ, Wu JL. On r-hued coloring of planar graphs with girth at least 6 Discrete Applied Mathematics. DOI: 10.1016/J.Dam.2015.05.015  0.561
2015 Liang Y, Lai HJ, Luo R, Xu R. Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations Graphs and Combinatorics. 1-11. DOI: 10.1007/S00373-015-1636-0  0.723
2015 Chen ZH, Han M, Lai HJ, Zhan M. Graphs with a 3-Cycle-2-Cover Graphs and Combinatorics. 31: 2103-2111. DOI: 10.1007/S00373-014-1516-Z  0.749
2014 Gu X, Lai H. Augmenting and preserving partition connectivity of a hypergraph The Journal of Combinatorics. 5: 271-289. DOI: 10.4310/Joc.2014.V5.N3.A1  0.591
2014 Li P, Lai H. On Mod $(2s+1)$-Orientations of Graphs Siam Journal On Discrete Mathematics. 28: 1820-1827. DOI: 10.1137/130920435  0.673
2014 Xu J, Li P, Miao Z, Wang K, Lai H. Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs International Journal of Computer Mathematics. 91: 1662-1672. DOI: 10.1080/00207160.2013.858808  0.691
2014 Liu Q, Hong Y, Gu X, Lai H. Note on edge-disjoint spanning trees and eigenvalues Linear Algebra and Its Applications. 458: 128-133. DOI: 10.1016/J.Laa.2014.05.044  0.716
2014 Liu Q, Hong Y, Lai H. Edge-disjoint spanning trees and eigenvalues ✩ Linear Algebra and Its Applications. 444: 146-151. DOI: 10.1016/J.Laa.2013.11.039  0.647
2014 Yang F, Li X, Lai H. Realizing degree sequences as Z3 -connected graphs Discrete Mathematics. 333: 110-119. DOI: 10.1016/J.Disc.2014.06.019  0.715
2014 Tian Y, Meng J, Lai H, Zhang Z. On the existence of super edge-connected graphs with prescribed degrees Discrete Mathematics. 328: 36-41. DOI: 10.1016/J.Disc.2014.03.025  0.619
2014 Song H, Fan S, Chen Y, Sun L, Lai H. On r-hued coloring of K4-minor free graphs Discrete Mathematics. 315: 47-52. DOI: 10.1016/J.Disc.2013.10.001  0.536
2014 Niu Z, Sun L, Xiong L, Lai H, Yan H. On extremal k-supereulerian graphs Discrete Mathematics. 314: 50-60. DOI: 10.1016/J.Disc.2013.09.003  0.768
2014 Lai H, Liang Y, Liu J, Meng J, Miao Z, Shao Y, Zhang Z. On strongly Z 2s+1 -connected graphs Discrete Applied Mathematics. 174: 73-80. DOI: 10.1016/J.Dam.2014.03.017  0.784
2014 Xu J, Chen Z, Lai H, Zhang M. Spanning trails in essentially 4-edge-connected graphs Discrete Applied Mathematics. 162: 306-313. DOI: 10.1016/J.Dam.2013.08.041  0.62
2014 Xiong W, Zhang Z, Lai H. Spanning 3-connected index of graphs Journal of Combinatorial Optimization. 27: 199-208. DOI: 10.1007/S10878-012-9583-7  0.658
2014 An M, Lai H, Li H, Su G, Tian R, Xiong L. Two operations on a graph preserving the (non)existence of 2-factors in its line graph Czechoslovak Mathematical Journal. 64: 1035-1044. DOI: 10.1007/S10587-014-0151-4  0.701
2014 Li XM, Lei L, Lai H, Zhang M. Supereulerian graphs and the Petersen graph Acta Mathematica Sinica. 30: 291-304. DOI: 10.1007/S10114-014-2272-Y  0.661
2014 Gu X, Lai H, Li P, Yao S. Characterizations of Strength Extremal Graphs Graphs and Combinatorics. 30: 1453-1461. DOI: 10.1007/S00373-013-1359-Z  0.649
2014 Yang W, Lai H, Li H, Guo X. Collapsible Graphs and Hamiltonicity of Line Graphs Graphs and Combinatorics. 30: 501-510. DOI: 10.1007/S00373-012-1280-X  0.707
2013 Li X, Ying GG, Zhao JL, Chen ZF, Lai HJ, Su HC. 4-Nonylphenol, bisphenol-A and triclosan levels in human urine of children and students in China, and the effects of drinking these bottled materials on the levels. Environment International. 52: 81-6. PMID 21794921 DOI: 10.1016/j.envint.2011.03.026  0.582
2013 Liu F, Huang Q, Lai H. Note on the spectral characterization of some cubic graphs with maximum number of triangles Linear Algebra and Its Applications. 438: 1393-1397. DOI: 10.1016/J.Laa.2012.09.015  0.591
2013 Gu X, Lai H. Realizing degree sequences with k-edge-connected uniform hypergraphs Discrete Mathematics. 313: 1394-1400. DOI: 10.1016/J.Disc.2013.03.003  0.542
2013 Xiong W, Lai H, Ma X, Wang K, Zhang M. Hamilton cycles in 3-connected claw-free and net-free graphs Discrete Mathematics. 313: 784-795. DOI: 10.1016/J.Disc.2012.12.016  0.562
2013 Hong Y, Lai H. Non-separating subgraphs☆ Discrete Mathematics. 313: 391-396. DOI: 10.1016/J.Disc.2012.11.004  0.519
2013 Li H, Lai H. Group colorability of multigraphs Discrete Mathematics. 313: 101-104. DOI: 10.1016/J.Disc.2012.09.009  0.543
2013 Lai H, Shao Y. On s-Hamiltonian Line Graphs Journal of Graph Theory. 74: 344-358. DOI: 10.1002/Jgt.21713  0.734
2012 Kewen Z, Lai H, Zhou J. Hamiltonian-Connected Graphs with Large Neighborhoods and Degrees Missouri Journal of Mathematical Sciences. 24: 54-66. DOI: 10.35834/Mjms/1337950499  0.735
2012 Li P, Lai H, Shao Y, Zhan M. Spanning cycles in regular matroids without small cocircuits European Journal of Combinatorics. 33: 1765-1776. DOI: 10.1016/J.Ejc.2012.03.033  0.76
2012 Hou X, Lai H, Zhan M, Zhang T, Zhou J. Z3-connectivity of 4-edge-connected 2-triangular graphs European Journal of Combinatorics. 33: 182-188. DOI: 10.1016/J.Ejc.2011.09.041  0.787
2012 Li D, Fan S, Lai H, Yao S. A dual version of the Brooks group coloring theorem Discrete Mathematics. 312: 2294-2303. DOI: 10.1016/J.Disc.2012.03.034  0.634
2012 Chen Y, Fan S, Lai H. On 3-connected hamiltonian line graphs Discrete Mathematics. 312: 1877-1882. DOI: 10.1016/J.Disc.2012.02.024  0.655
2012 Li X, Lai H, Shao Y. Degree condition and Z3-connectivity Discrete Mathematics. 312: 1658-1669. DOI: 10.1016/J.Disc.2012.01.013  0.834
2012 Niu Z, Lai H, Xiong L. Spanning subgraph with Eulerian components Discrete Mathematics. 312: 1013-1018. DOI: 10.1016/J.Disc.2011.11.003  0.701
2012 Li P, Lai H, Liang Y. Characterization of removable elements with respect to having k disjoint bases in a matroid Discrete Applied Mathematics. 160: 2445-2451. DOI: 10.1016/J.Dam.2012.07.011  0.717
2012 Yang W, Lai H, Li H, Guo X. Collapsible graphs and Hamiltonian connectedness of line graphs Discrete Applied Mathematics. 160: 1837-1844. DOI: 10.1016/J.Dam.2012.03.028  0.639
2012 Chen Y, Fan S, Lai H, Song H, Sun L. On dynamic coloring for planar graphs and graphs of higher genus Discrete Applied Mathematics. 160: 1064-1071. DOI: 10.1016/J.Dam.2012.01.012  0.646
2012 Yang W, Xiong L, Lai H, Guo X. Hamiltonicity of 3-connected line graphs Applied Mathematics Letters. 25: 1835-1838. DOI: 10.1016/J.Aml.2012.02.032  0.582
2012 Gu X, Lai H, Liang Y. Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees Applied Mathematics Letters. 25: 1426-1429. DOI: 10.1016/J.Aml.2011.12.016  0.41
2012 Chen Y, Chen Z, Lai H, Li P, Wei E. On Spanning Disjoint Paths in Line Graphs Graphs and Combinatorics. 29: 1721-1731. DOI: 10.1007/S00373-012-1237-0  0.704
2012 Xu J, Li P, Lai H. The Connectivity and Diameter of Second Order Circuit Graphs of Matroids Graphs and Combinatorics. 28: 737-742. DOI: 10.1007/S00373-011-1074-6  0.388
2012 Hou X, Lai H, Li P, Zhang C. Group Connectivity of Complementary Graphs Journal of Graph Theory. 69: 464-470. DOI: 10.1002/Jgt.20595  0.696
2011 Fan S, Lai H, Zhou J. The Maximum Size of an Edge Cut and Graph Homomorphisms Applied Mathematics-a Journal of Chinese Universities Series B. 2: 1263-1269. DOI: 10.4236/Am.2011.210176  0.8
2011 Wei E, Chen Y, Li P, Lai H. Every N2-Locally Connected Claw-Free Graph With Minimum Degree At Least 7 Is Z3-Connected Discrete Mathematics, Algorithms and Applications. 3: 193-201. DOI: 10.1142/S1793830911001140  0.707
2011 Gu X, Lai H, Yao S. Characterization of minimally (2,l)-connected graphs Information Processing Letters. 111: 1124-1129. DOI: 10.1016/J.Ipl.2011.09.012  0.723
2011 Lai H, Li H, Li P, Liang Y, Yao S. Mod (2p+1)-orientations in line graphs Information Processing Letters. 111: 1085-1088. DOI: 10.1016/J.Ipl.2011.09.005  0.753
2011 Lai HJ, Lemos M, Reid TJ, Shao Y, Wu H. Obstructions to a binary matroid being graphic European Journal of Combinatorics. 32: 853-860. DOI: 10.1016/J.Ejc.2011.01.015  0.464
2011 Lai H, Li H, Li P, Liang Y, Yao S. Group connectivity in line graphs Discrete Mathematics. 311: 2295-2307. DOI: 10.1016/J.Disc.2011.07.017  0.79
2011 Lai H, Liang Y, Li P, Xu J. Degree sequences and graphs with disjoint spanning trees Discrete Applied Mathematics. 159: 1447-1452. DOI: 10.1016/J.Dam.2011.05.009  0.664
2011 Lai H, Liang Y. Supereulerian graphs in the graph family C2(6,k) Discrete Applied Mathematics. 159: 467-477. DOI: 10.1016/J.Dam.2010.12.005  0.734
2011 Lai H, Yan H. Supereulerian graphs and matchings Applied Mathematics Letters. 24: 1867-1869. DOI: 10.1016/J.Aml.2011.05.008  0.772
2011 Lai H, Li X, Shao Y, Zhan M. Group connectivity and group colorings of graphs — A survey Acta Mathematica Sinica. 27: 405-434. DOI: 10.1007/S10114-010-9746-3  0.847
2011 Lai HJ, Li H, Shao Y, Zhan M. On 3-Edge-Connected Supereulerian Graphs Graphs and Combinatorics. 27: 207-214. DOI: 10.1007/S00373-010-0974-1  0.815
2010 Lai H, Li P, Liang Y, Xu J. Reinforcing a Matroid to Have k Disjoint Bases Applied Mathematics-a Journal of Chinese Universities Series B. 1: 244-249. DOI: 10.4236/Am.2010.13030  0.714
2010 Zhang X, Zhan M, Xu R, Shao Y, Li X, Lai H. Degree sum condition for Z3-connectivity in graphs Discrete Mathematics. 310: 3390-3397. DOI: 10.1016/J.Disc.2010.08.004  0.829
2010 Li X, Li D, Lai H. On 3-edge-connected supereulerian graphs in graph family C (l,k) Discrete Mathematics. 310: 2455-2459. DOI: 10.1016/J.Disc.2010.05.021  0.669
2010 Han L, Lai H, Xiong L, Yan H. The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index Discrete Mathematics. 310: 2082-2090. DOI: 10.1016/J.Disc.2010.03.020  0.792
2010 Yao X, Li X, Lai H. Degree conditions for group connectivity Discrete Mathematics. 310: 1050-1058. DOI: 10.1016/J.Disc.2009.10.023  0.753
2010 Lei L, Li X, Wang B, Lai H. On (s,t)-supereulerian graphs in locally highly connected graphs Discrete Mathematics. 310: 929-934. DOI: 10.1016/J.Disc.2009.08.012  0.604
2010 Hobbs AM, Kannan L, Lai HJ, Lai H, Weng G. Balanced and 1-balanced graph constructions Discrete Applied Mathematics. 158: 1511-1523. DOI: 10.1016/J.Dam.2010.05.004  0.683
2009 Liang Y, Liu B, Lai H. Multi-g base index of primitive anti-symmetric sign pattern matrices Linear & Multilinear Algebra. 57: 535-546. DOI: 10.1080/03081080701861849  0.603
2009 Lai H, Shao Y, Wu H, Zhou J. On mod (2p +1)-orientations of graphs Journal of Combinatorial Theory, Series B. 99: 399-406. DOI: 10.1016/J.Jctb.2008.08.001  0.798
2009 Lai H, Miao L, Shao Y. Every line graph of a 4-edge-connected graph is Z3-connected European Journal of Combinatorics. 30: 595-601. DOI: 10.1016/J.Ejc.2008.02.013  0.726
2009 Li X, Li D, Lai H. The supereulerian graphs in the graph family C(l,k) Discrete Mathematics. 309: 2937-2942. DOI: 10.1016/J.Disc.2008.06.038  0.688
2009 Chen Z, Lai H, Xiong L, Yan H, Zhan M. Hamilton-connected indices of graphs Discrete Mathematics. 309: 4819-4827. DOI: 10.1016/J.Disc.2008.06.030  0.818
2009 Catlin PA, Lai H, Shao Y. Edge-connectivity and edge-disjoint spanning trees Discrete Mathematics. 309: 1033-1040. DOI: 10.1016/J.Disc.2007.11.056  0.726
2009 Kannan L, Hobbs A, Lai HJ, Lai H. Transforming a graph into a 1-balanced graph Discrete Applied Mathematics. 157: 300-308. DOI: 10.1016/J.Dam.2008.03.012  0.688
2009 Lai H, Shao Y, Yu G, Zhan M. Hamiltonian connectedness in 3-connected line graphs Discrete Applied Mathematics. 157: 982-990. DOI: 10.1016/J.Dam.2008.02.005  0.829
2009 Subramani K, Lai H, Gu X. Random walks for selected boolean implication and equivalence problems Acta Informatica. 46: 155-168. DOI: 10.1007/S00236-009-0089-4  0.536
2008 Lai H. Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions Siam Journal On Discrete Mathematics. 21: 844-850. DOI: 10.1137/060676945  0.64
2008 Fan G, Lai H, Xu R, Zhang C, Zhou C. Nowhere-zero 3-flows in triangularly connected graphs Journal of Combinatorial Theory, Series B. 98: 1325-1336. DOI: 10.1016/J.Jctb.2008.02.008  0.629
2008 Lai H, Liu B, Liu Y, Shao Y. Spanning cycles in regular matroids without M∗(K5) minors European Journal of Combinatorics. 29: 298-310. DOI: 10.1016/J.Ejc.2006.07.011  0.649
2008 Fan S, Lai H, Shao Y, Zhang T, Zhou J. Note: Degree sequence and supereulerian graphs Discrete Mathematics. 308: 6626-6631. DOI: 10.1016/J.Disc.2007.11.008  0.682
2008 Lai H, Shao Y, Zhan M. Note: Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected Discrete Mathematics. 308: 5312-5316. DOI: 10.1016/J.Disc.2007.09.045  0.814
2008 Lili Z, Eschen E, Lai H, Shao Y. Note: The s-Hamiltonian index Discrete Mathematics. 308: 4779-4785. DOI: 10.1016/J.Disc.2007.08.073  0.678
2008 Lai H, Liang Y, Shao Y. Note: On s-hamiltonian-connected line graphs Discrete Mathematics. 308: 4293-4297. DOI: 10.1016/J.Disc.2007.07.120  0.806
2008 Dengxin L, Lai H, Shao Y, Zhan M. Note: Hamiltonian connected hourglass free line graphs Discrete Mathematics. 308: 2634-2636. DOI: 10.1016/J.Disc.2007.06.009  0.8
2008 Kewen Z, Lai H, Zhou J. Hamiltonian-connected graphs Computers & Mathematics With Applications. 55: 2707-2714. DOI: 10.1016/J.Camwa.2007.10.018  0.772
2008 Lai H, Xu R, Zhou J. On Group Connectivity of Graphs Graphs and Combinatorics. 24: 195-203. DOI: 10.1007/S00373-008-0780-1  0.747
2007 Lai H, Li X, Yu G. Note: An inequality for the group chromatic number of a graph Discrete Mathematics. 307: 3076-3080. DOI: 10.1016/J.Disc.2007.03.014  0.707
2007 Li M, Guo C, Xiong L, Li D, Lai H. Note: Quadrangularly connected claw-free graphs Discrete Mathematics. 307: 1205-1211. DOI: 10.1016/J.Disc.2006.07.034  0.6
2007 Zhao K, Lai H, Shao Y. New sufficient condition for Hamiltonian graphs Applied Mathematics Letters. 20: 116-122. DOI: 10.1016/J.Aml.2005.10.024  0.738
2007 Lai H, Xu R, Zhang C. On Circular Flows Of Graphs Combinatorica. 27: 245-246. DOI: 10.1007/S00493-007-0055-0  0.558
2007 Chen Z, Lai H, Shiu W, Li D. An s -Hamiltonian Line Graph Problem Graphs and Combinatorics. 23: 241-248. DOI: 10.1007/S00373-007-0727-Y  0.642
2006 Lai H, Shao Y, Wu H, Zhou J. Every 3-connected, essentially 11-connected line graph is Hamiltonian Journal of Combinatorial Theory, Series B. 96: 571-576. DOI: 10.1016/J.Jctb.2005.11.002  0.802
2006 Lai H, Shao Y, Zhan M. Hamiltonicity in 3-connected claw-free graphs Journal of Combinatorial Theory, Series B. 96: 493-504. DOI: 10.1016/J.Jctb.2005.10.003  0.767
2006 Lai H, Yao X. Group connectivity of graphs with diameter at most 2 European Journal of Combinatorics. 27: 436-443. DOI: 10.1016/J.Ejc.2004.11.001  0.676
2006 Lai H, Li X. Group chromatic number of planar graphs of girth at least 4 Journal of Graph Theory. 52: 51-72. DOI: 10.1002/Jgt.V52:1  0.749
2005 Li D, Lai H, Zhan M. Eulerian subgraphs and Hamilton-connected line graphs Discrete Applied Mathematics. 145: 422-428. DOI: 10.1016/J.Dam.2004.04.005  0.758
2005 Lai HT, Li X. On group chromatic number of graphs Graphs and Combinatorics. 21: 469-474. DOI: 10.1007/S00373-005-0625-0  0.735
2005 Lai HJ, Li X, Poon H, Ou Y. Spanning trails connecting given edges Graphs and Combinatorics. 21: 77-88. DOI: 10.1007/S00373-004-0579-7  0.728
2005 Lai H, Li X, Poon H. Nowhere zero 4-flow in regular matroids Journal of Graph Theory. 49: 196-204. DOI: 10.1002/Jgt.V49:3  0.732
2004 Yang X, Evans DJ, Chen B, Megson GM, Lai H. On the maximal connected component of hypercube with faulty vertices International Journal of Computer Mathematics. 81: 1175-1185. DOI: 10.1080/00207160500113173  0.359
2003 Lai H, Li X. Note: small cycle cover of 2-connected cubic graphs Discrete Mathematics. 269: 295-302. DOI: 10.1016/S0012-365X(03)00058-X  0.571
2003 Hennayake K, Lai H, Li D, Mao J. Minimally ( k, k )-edge-connected graphs Journal of Graph Theory. 44: 116-131. DOI: 10.1002/Jgt.V44:2  0.646
2003 Chen Z, Lai H, Li X, Li D, Mao J. Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs Journal of Graph Theory. 42: 308-319. DOI: 10.1002/Jgt.V42:4  0.694
2003 Lai H. Nowhere-zero 3-flows in locally connected graphs Journal of Graph Theory. 42: 211-219. DOI: 10.1002/Jgt.V42:3  0.426
2002 Lai H, Zhang X. Group Chromatic Number of Graphs without K5-Minors Graphs and Combinatorics. 18: 147-154. DOI: 10.1007/S003730200009  0.668
2002 Lai HJ, Poon H. Cycle cover ratio of regular matroids European Journal of Combinatorics. 23: 1007-1014. DOI: 10.1006/Eujc.2002.0606  0.311
2001 Chen Z, Lai H, Lai H. Nowhere zero flows in line graphs Discrete Mathematics. 230: 133-141. DOI: 10.1016/S0012-365X(00)00076-5  0.657
2001 Catlin PA, Hobbs AM, Lai HJ. Graph family operations Discrete Mathematics. 230: 71-97. DOI: 10.1016/S0012-365X(00)00071-6  0.61
2001 Lai H. Eulerian subgraphs containing given edges Discrete Mathematics. 230: 63-69. DOI: 10.1016/S0012-365X(00)00070-4  0.616
2001 Lai H, Soltés L. Line Graphs and Forbidden Induced Subgraphs Journal of Combinatorial Theory, Series B. 82: 38-55. DOI: 10.1006/Jctb.2000.2019  0.624
2001 Lai H, Zhang C. Hamilton weights and Petersen minors Journal of Graph Theory. 38: 197-219. DOI: 10.1002/Jgt.V38:4  0.671
2000 Lai HJ. Group connectivity of 3-edge-connected chordal graphs Graphs and Combinatorics. 16: 165-176. DOI: 10.1007/Pl00021177  0.662
1999 Lai HJ. Extending a partial nowhere-zero 4-flow Journal of Graph Theory. 30: 277-288. DOI: 10.1002/(Sici)1097-0118(199904)30:4<>1.0.Co;2-8  0.647
1998 Lai H. Eulerian subgraphs containing given vertices and hamiltonian line graphs Discrete Mathematics. 178: 93-107. DOI: 10.1016/S0012-365X(97)81820-1  0.677
1997 Lai HC. Optimality conditions for semi-preinvex programming Taiwanese Journal of Mathematics. 1: 389-404.  0.302
1996 Catlin PA, Han Z, Lai H. Graphs without spanning closed trails Discrete Mathematics. 160: 81-91. DOI: 10.1016/S0012-365X(95)00149-Q  0.707
1996 Catlin PA, Lai H. Supereulerian Graphs and the Petersen Graph Journal of Combinatorial Theory, Series B. 66: 123-139. DOI: 10.1006/Jctb.1996.0009  0.623
1996 Lai HJ, Lai H, Payan C. A property on edge-disjoint spanning trees European Journal of Combinatorics. 17: 447-450. DOI: 10.1006/Eujc.1996.0038  0.613
1995 Lai HJ. Large survivable nets and the generalized prisms Discrete Applied Mathematics. 61: 181-185. DOI: 10.1016/0166-218X(94)00131-V  0.6
1995 Lai HJ, Lai H. Every matroid is a submatroid of a uniformly dense matroid Discrete Applied Mathematics. 63: 151-160. DOI: 10.1016/0166-218X(94)00029-D  0.663
1995 Lai H, Weng G. Strength and fractional arboricity of complementary graphs Discrete Mathematics. 143: 141-151. DOI: 10.1016/0012-365X(95)00012-L  0.679
1995 Lai HJ. Supereulerian graphs and excluded induced minors Discrete Mathematics. 146: 133-143. DOI: 10.1016/0012-365X(94)00159-7  0.704
1995 Catlin PA, Lai H. Vertex arboricity and maximum degree Discrete Mathematics. 141: 37-46. DOI: 10.1016/0012-365X(93)E0205-I  0.633
1995 Lai H. The size of graphs without nowhere-zero 4-flows Journal of Graph Theory. 19: 385-395. DOI: 10.1002/Jgt.3190190311  0.674
1994 Lai HJ. Every 4-Connected Line Graph of a Planar Graph is Hamiltonian Graphs and Combinatorics. 10: 249-253. DOI: 10.1007/Bf02986673  0.697
1994 Lai H, Zhang C. Edge-maximal ( k, l )-graphs Journal of Graph Theory. 18: 227-240. DOI: 10.1002/Jgt.3190180303  0.631
1993 Chen Z, Lai H. Collapsible graphs and matchings Journal of Graph Theory. 17: 597-605. DOI: 10.1002/Jgt.3190170506  0.71
1993 Lai H. Supereulerian complementary graphs Journal of Graph Theory. 17: 263-273. DOI: 10.1002/Jgt.3190170214  0.682
1992 Catlin PA, Grossman JW, Hobbs AM, Lai HJ. Fractional arboricity, strength, and principal partitions in graphs and matroids Discrete Applied Mathematics. 40: 285-302. DOI: 10.1016/0166-218X(92)90002-R  0.678
1992 Lai H, Zhang C. Nowhere-zero 3-flows of highly connected graphs Discrete Mathematics. 110: 179-183. DOI: 10.1016/0012-365X(92)90706-L  0.673
1992 Lai HJ, Lai H. Duality in graph families Discrete Mathematics. 110: 165-177. DOI: 10.1016/0012-365X(92)90705-K  0.453
1991 Lai HJ. Graph whose edges are in small cycles Discrete Mathematics. 94: 11-22. DOI: 10.1016/0012-365X(91)90302-I  0.682
1989 Lai HJ. Unique graph homomorphisms onto odd cycles, II Journal of Combinatorial Theory, Series B. 46: 363-376. DOI: 10.1016/0095-8956(89)90056-7  0.636
1988 Lai HJ. On the Hamiltonian index Discrete Mathematics. 69: 43-53. DOI: 10.1016/0012-365X(88)90176-8  0.621
1988 Lai H. Contractions and hamiltonian line graphs Journal of Graph Theory. 12: 11-15. DOI: 10.1002/Jgt.3190120103  0.564
1985 Lai HC. Multipliers for some spaces of banach algebra valued functions Rocky Mountain Journal of Mathematics. 15: 157-166. DOI: 10.1216/RMJ-1985-15-1-157  0.398
Show low-probability matches.