Hong-Jian Lai

Yanmei Hong, Hong-Jian Lai: Non-separating subgraphs. Discrete Mathematics 313(4): 391-396 (2013)

Wei Xiong, Hong-Jian Lai, Xiaoling Ma, Keke Wang, Meng Zhang: Hamilton cycles in 3-connected claw-free and net-free graphs. Discrete Mathematics 313(6): 784-795 (2013)

Xiaofeng Gu, Hong-Jian Lai: Realizing degree sequences with k-edge-connected uniform hypergraphs. Discrete Mathematics 313(11): 1394-1400 (2013)

Xiaofeng Gu, Hong-Jian Lai, Yanting Liang: Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees. Appl. Math. Lett. 25(10): 1426-1429 (2012)

Weihua Yang, Liming Xiong, Hong-Jian Lai, Xiaofeng Guo: Hamiltonicity of 3-connected line graphs. Appl. Math. Lett. 25(11): 1835-1838 (2012)

Kewen Zhao, Lili Zhang, Hong-Jian Lai, Yehong Shao: Hamiltonian graphs involving neighborhood conditions. Ars Comb. 105: 161-170 (2012)

Xiaomin Li, Dengxin Li, Hong-Jian Lai: Spanning Eulerian Subgraphs in Generalized Prisms. Ars Comb. 106: 305-312 (2012)

Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, Lei Sun: On dynamic coloring for planar graphs and graphs of higher genus. Discrete Applied Mathematics 160(7-8): 1064-1071 (2012)

Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo: Collapsible graphs and Hamiltonian connectedness of line graphs. Discrete Applied Mathematics 160(12): 1837-1844 (2012)

Ping Li, Hong-Jian Lai, Yanting Liang: Characterization of removable elements with respect to having k disjoint bases in a matroid. Discrete Applied Mathematics 160(16-17): 2445-2451 (2012)

Zhaohong Niu, Hong-Jian Lai, Liming Xiong: Spanning subgraph with Eulerian components. Discrete Mathematics 312(5): 1013-1018 (2012)

Xiangwen Li, Hong-Jian Lai, Yehong Shao: Degree condition and Z₃-connectivity. Discrete Mathematics 312(10): 1658-1669 (2012)

Ye Chen, Suohai Fan, Hong-Jian Lai: On 3-connected hamiltonian line graphs. Discrete Mathematics 312(11): 1877-1882 (2012)

Deying Li, Suohai Fan, Hong-Jian Lai, Senmei Yao: A dual version of the Brooks group coloring theorem. Discrete Mathematics 312(15): 2294-2303 (2012)

Xinmin Hou, Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou: Z₃-connectivity of 4-edge-connected 2-triangular graphs. Eur. J. Comb. 33(2): 182-188 (2012)

Ping Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan: Spanning cycles in regular matroids without small cocircuits. Eur. J. Comb. 33(8): 1765-1776 (2012)

Jinquan Xu, Ping Li, Hong-Jian Lai: The Connectivity and Diameter of Second Order Circuit Graphs of Matroids. Graphs and Combinatorics 28(5): 737-742 (2012)

Xinmin Hou, Hong-Jian Lai, Ping Li, Cun-Quan Zhang: Group connectivity of complementary graphs. Journal of Graph Theory 69(4): 464-470 (2012)

Hong-Jian Lai, Huiya Yan: Supereulerian graphs and matchings. Appl. Math. Lett. 24(11): 1867-1869 (2011)

Hong-Jian Lai, Yanting Liang: Supereulerian graphs in the graph family C₂(6, k). Discrete Applied Mathematics 159(6): 467-477 (2011)

Hong-Jian Lai, Yanting Liang, Ping Li, Jinquan Xu: Degree sequences and graphs with disjoint spanning trees. Discrete Applied Mathematics 159(14): 1447-1452 (2011)

Hong-Jian Lai, Hao Li, Ping Li, Yanting Liang, Senmei Yao: Group connectivity in line graphs. Discrete Mathematics 311(20): 2295-2307 (2011)

Erling Wei, Ye Chen, Ping Li, Hong-Jian Lai: Every N₂-Locally Connected claw-Free Graph with Minimum Degree at Least 7 is Z₃-Connected. Discrete Math., Alg. and Appl. 3(2): 193-202 (2011)

Hong-Jian Lai, Manoel Lemos, Talmage James Reid, Yehong Shao, Haidong Wu: Obstructions to a binary matroid being graphic. Eur. J. Comb. 32(6): 853-860 (2011)

Hong-Jian Lai, Hao Li, Yehong Shao, Mingquan Zhan: On 3-Edge-Connected Supereulerian Graphs. Graphs and Combinatorics 27(2): 207-214 (2011)

Hong-Jian Lai, Hao Li, Ping Li, Yanting Liang, Senmei Yao: Mod (2p+1)-orientations in line graphs. Inf. Process. Lett. 111(23-24): 1085-1088 (2011)

Xiaofeng Gu, Hong-Jian Lai, Senmei Yao: Characterization of minimally (2, l)-connected graphs. Inf. Process. Lett. 111(23-24): 1124-1129 (2011)

Hong-Jian Lai, Mingchu Li, Yehong Shao, Liming Xiong: Spanning eulerian subgraphs in N²-locally connected claw-free graphs. Ars Comb. 94 (2010)

Arthur M. Hobbs, Lavanya Kannan, Hong-Jian Lai, Hongyuan Lai, Guoqing Weng: Balanced and 1-balanced graph constructions. Discrete Applied Mathematics 158(14): 1511-1523 (2010)

Lan Lei, Xiao-Min Li, Bin Wang, Hong-Jian Lai: On (s, t)-supereulerian graphs in locally highly connected graphs. Discrete Mathematics 310(4): 929-934 (2010)

Xiangjuan Yao, Xiangwen Li, Hong-Jian Lai: Degree conditions for group connectivity. Discrete Mathematics 310(5): 1050-1058 (2010)

Longsheng Han, Hong-Jian Lai, Liming Xiong, Huiya Yan: The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index. Discrete Mathematics 310(15-16): 2082-2090 (2010)

Xiaomin Li, Dengxin Li, Hong-Jian Lai: On 3-edge-connected supereulerian graphs in graph family C(l, k). Discrete Mathematics 310(17-18): 2455-2459 (2010)

Xiaoxia Zhang, Mingquan Zhan, Rui Xu, Yehong Shao, Xiangwen Li, Hong-Jian Lai: Degree sum condition for Z₃-connectivity in graphs. Discrete Mathematics 310(23): 3390-3397 (2010)

Hong-Jian Lai, Liming Xiong, Huiya Yan, Jin Yan: Every 3-connected claw-free Z₈-free graph is Hamiltonian. Journal of Graph Theory 64(1): 1-11 (2010)

K. Subramani, Hong-Jian Lai, Xiaofeng Gu: Random walks for selected boolean implication and equivalence problems. Acta Inf. 46(2): 155-168 (2009)

Damin Liu, Hong-Jian Lai, Zhi-Hong Chen: Reinforcing the number of disjoint spanning trees. Ars Comb. 93 (2009)

Lavanya Kannan, Arthur M. Hobbs, Hong-Jian Lai, Hongyuan Lai: Transforming a graph into a 1-balanced graph. Discrete Applied Mathematics 157(2): 300-308 (2009)

Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan: Hamiltonian connectedness in 3-connected line graphs. Discrete Applied Mathematics 157(5): 982-990 (2009)

Paul A. Catlin, Hong-Jian Lai, Yehong Shao: Edge-connectivity and edge-disjoint spanning trees. Discrete Mathematics 309(5): 1033-1040 (2009)

Xiaomin Li, Dengxin Li, Hong-Jian Lai: The supereulerian graphs in the graph family C(l, k). Discrete Mathematics 309(9): 2937-2942 (2009)

Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan, Mingquan Zhan: Hamilton-connected indices of graphs. Discrete Mathematics 309(14): 4819-4827 (2009)

Hong-Jian Lai, Lianying Miao, Yehong Shao: Every line graph of a 4-edge-connected graph is I-connected. Eur. J. Comb. 30(2): 595-601 (2009)

Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou: On mod (2p+1)-orientations of graphs. J. Comb. Theory, Ser. B 99(2): 399-406 (2009)

Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Jian Lai: Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs. FAW 2009: 40-50

Yan Jin, Kewen Zhao, Hong-Jian Lai, Ju Zhou: New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs. Ars Comb. 88 (2008)

Jingjing Chen, Elaine M. Eschen, Hong-Jian Lai: Group connectivity of certain graphs. Ars Comb. 89 (2008)

Kewen Zhao, Hong-Jian Lai, Ju Zhou: Hamiltonian-connected graphs. Computers & Mathematics with Applications 55(12): 2707-2714 (2008)

Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan: Hamiltonian connected hourglass free line graphs. Discrete Mathematics 308(12): 2634-2636 (2008)

Hong-Jian Lai, Yanting Liang, Yehong Shao: On s-hamiltonian-connected line graphs. Discrete Mathematics 308(18): 4293-4297 (2008)

Lili Zhang, Elaine M. Eschen, Hong-Jian Lai, Yehong Shao: The s-Hamiltonian index. Discrete Mathematics 308(20): 4779-4785 (2008)

Hong-Jian Lai, Yehong Shao, Mingquan Zhan: Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected. Discrete Mathematics 308(22): 5312-5316 (2008)

Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang, Ju Zhou: Degree sequence and supereulerian graphs. Discrete Mathematics 308(24): 6626-6631 (2008)

Hong-Jian Lai, Bolian Liu, Yan Liu, Yehong Shao: Spanning cycles in regular matroids without M^*(K₅) minors. Eur. J. Comb. 29(1): 298-310 (2008)

Hong-Jian Lai, Rui Xu, Ju Zhou: On Group Connectivity of Graphs. Graphs and Combinatorics 24(3): 195-203 (2008)

Genghua Fan, Hong-Jian Lai, Rui Xu, Cun-Quan Zhang, Chuixiang Zhou: Nowhere-zero 3-flows in triangularly connected graphs. J. Comb. Theory, Ser. B 98(6): 1325-1336 (2008)

Kewen Zhao, Hong-Jian Lai, Yehong Shao: New sufficient condition for Hamiltonian graphs. Appl. Math. Lett. 20(1): 116-122 (2007)

Hong-Jian Lai, Rui Xu, Cun-Quan Zhang: On Circular Flows Of Graphs. Combinatorica 27(2): 245-246 (2007)

MingChu Li, Cheng Guo, Liming Xiong, Dengxin Li, Hong-Jian Lai: Quadrangularly connected claw-free graphs. Discrete Mathematics 307(9-10): 1205-1211 (2007)

Hong-Jian Lai, Xiangjuan Yao: Erratum to "Collapsible biclaw-free graphs": [Discrete Math 306 (2006) 2115-2117]. Discrete Mathematics 307(9-10): 1217 (2007)

Hong-Jian Lai, Xiangwen Li, Gexin Yu: An inequality for the group chromatic number of a graph. Discrete Mathematics 307(23): 3076-3080 (2007)

Zhi-Hong Chen, Hong-Jian Lai, Wai-Chee Shiu, Deying Li: An s -Hamiltonian Line Graph Problem. Graphs and Combinatorics 23(3): 241-248 (2007)

Hong-Jian Lai: Mod (2p + 1)-Orientations and $K_1,2p+1-Decompositions. SIAM J. Discrete Math. 21(4): 844-850 (2007)

Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan: Hamiltonian Connected Line Graphs. International Conference on Computational Science (3) 2007: 377-380

Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Taozhi Shui, Suohai Fan: Conditional colorings of graphs. Discrete Mathematics 306(16): 1997-2004 (2006)

Hong-Jian Lai, Xiangjuan Yao: Collapsible biclaw-free graphs. Discrete Mathematics 306(17): 2115-2117 (2006)

Hong-Jian Lai, Xiangjuan Yao: Group connectivity of graphs with diameter at most 2. Eur. J. Comb. 27(3): 436-443 (2006)

Hong-Jian Lai, Yehong Shao, Mingquan Zhan: Hamiltonicity in 3-connected claw-free graphs. J. Comb. Theory, Ser. B 96(4): 493-504 (2006)

Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou: Every 3-connected, essentially 11-connected line graph is Hamiltonian. J. Comb. Theory, Ser. B 96(4): 571-576 (2006)

Hong-Jian Lai, Xiangwen Li: Group chromatic number of planar graphs of girth at least 4. Journal of Graph Theory 52(1): 51-72 (2006)

Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan Zhan: Supereulerian planar graphs. Ars Comb. 75 (2005)

Dengxin Li, Hong-Jian Lai, Mingquan Zhan: Eulerian subgraphs and Hamilton-connected line graphs. Discrete Applied Mathematics 145(3): 422-428 (2005)

Hong-Jian Lai, Xiangwen Li, Hoifung Poon, Yongbin Ou: Spanning Trails Connecting Given Edges. Graphs and Combinatorics 21(1): 77-88 (2005)

Hong-Jian Lai, Xiangwen Li: On Group Chromatic Number of Graphs. Graphs and Combinatorics 21(4): 469-474 (2005)

Hong-Jian Lai, Yehong Shao, Mingquan Zhan: Hamiltonian N₂-locally connected claw-free graphs. Journal of Graph Theory 48(2): 142-146 (2005)

Hong-Jian Lai, Xiangwen Li, Hoifung Poon: Nowhere zero 4-flow in regular matroids. Journal of Graph Theory 49(3): 196-204 (2005)

Xiaofan Yang, Hong-Jian Lai, David J. Evans, Graham M. Megson: Global asymptotic stability in a rational recursive sequence. Applied Mathematics and Computation 158(3): 703-716 (2004)

Xiaofan Yang, David J. Evans, Bill Chen, Graham M. Megson, Hong-Jian Lai: On the maximal connected component of hypercube with faulty vertices. Int. J. Comput. Math. 81(5): 515-525 (2004)

Xiaofan Yang, David J. Evans, Hong-Jian Lai, Graham M. Megson: Generalized honeycomb torus is Hamiltonian. Inf. Process. Lett. 92(1): 31-37 (2004)

Hong-Jian Lai, Bruce Montgomery, Hoifung Poon: Upper Bounds of Dynamic Chromatic Number. Ars Comb. 68 (2003)

Hong-Jian Lai, Xiangwen Li: Small cycle cover of 2-connected cubic graphs. Discrete Mathematics 269(1-3): 295-302 (2003)

Hong-Jian Lai: Nowhere-zero 3-flows in locally connected graphs. Journal of Graph Theory 42(3): 211-219 (2003)

Zhi-Hong Chen, Hong-Jian Lai, Xiangwen Li, Deying Li, Jingzhong Mao: Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs. Journal of Graph Theory 42(4): 308-319 (2003)

Kamal Hennayake, Hong-Jian Lai, Deying Li, Jingzhong Mao: Minimally (k, k)-edge-connected graphs. Journal of Graph Theory 44(2): 116-131 (2003)

Hong-Jian Lai, Xiankun Zhang: Group Colorability of Graphs. Ars Comb. 62 (2002)

Hong-Jian Lai, Hoifung Poon: Cycle Cover Ratio of Regular Matroids. Eur. J. Comb. 23(8): 1007-1014 (2002)

Hong-Jian Lai, Xiankun Zhang: Group Chromatic Number of Graphs without K₅-Minors. Graphs and Combinatorics 18(1): 147-154 (2002)

Arthur M. Hobbs, Hong-Jian Lai: Dedication. Discrete Mathematics 230(1-3): 1- (2001)

Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson: Paul Catlin 1948-1995. Discrete Mathematics 230(1-3): 3-12 (2001)

Hong-Jian Lai: Eulerian subgraphs containing given edges. Discrete Mathematics 230(1-3): 63-69 (2001)

Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai: Graph family operations. Discrete Mathematics 230(1-3): 71-97 (2001)

Zhi-Hong Chen, Hong-Jian Lai, Hongyuan Lai: Nowhere zero flows in line graphs. Discrete Mathematics 230(1-3): 133-141 (2001)

Hong-Jian Lai, Lubomír Soltés: Line Graphs and Forbidden Induced Subgraphs. J. Comb. Theory, Ser. B 82(1): 38-55 (2001)

Hong-Jian Lai, Cun-Quan Zhang: Hamilton weights and Petersen minors. Journal of Graph Theory 38(4): 197-219 (2001)

Hong-Jian Lai, Xiankun Zhang: Spanning trails that join given edges in 3-edge-connected graphs. Ars Comb. 57 (2000)

Hong-Jian Lai: Group Connectivity of 3-Edge-Connected Chordal Graphs. Graphs and Combinatorics 16(2): 165-176 (2000)

Zhi-Hong Chen, Kuang Ying-Qiang, Hong-Jian Lai: Connectivity of cycle matroids and bicircular matroids. Ars Comb. 52 (1999)

Hong-Jian Lai: Extending a partial nowhere-zero 4-flow. Journal of Graph Theory 30(4): 277-288 (1999)

Zhi-Hong Chen, Hong-Jian Lai: Supereulerian graphs and the Petersen Graph, II. Ars Comb. 48 (1998)

Hong-Jian Lai: Eulerian subgraphs containing given vertices and hamiltonian line graphs. Discrete Mathematics 178(1-3): 93-107 (1998)

Paul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai: Graphs without spanning closed trails. Discrete Mathematics 160(1-3): 81-91 (1996)

Hong-Jian Lai, Hongyuan Lai, Charles Payan: A Property on Edge-disjoint Spanning Trees. Eur. J. Comb. 17(5): 447-450 (1996)

Paul A. Catlin, Hong-Jian Lai: Supereulerian Graphs and the Petersen Graph. J. Comb. Theory, Ser. B 66(1): 123-139 (1996)

Hong-Jian Lai: Large Survivable Nets and the Generalized Prisms. Discrete Applied Mathematics 61(2): 181-185 (1995)

Hong-Jian Lai, Hongyuan Lai: Every Matroid Is a Submatroid of a Uniformly Dense Matroid. Discrete Applied Mathematics 63(2): 151-160 (1995)

Paul A. Catlin, Hong-Jian Lai: Vertex arboricity and maximum degree. Discrete Mathematics 141(1-3): 37-46 (1995)

Hong-Jian Lai, Guoqing Weng: Strength and fractional arboricity of complementary graphs. Discrete Mathematics 143(1-3): 141-151 (1995)

Hong-Jian Lai: Supereulerian graphs and excluded induced minors. Discrete Mathematics 146(1-3): 133-143 (1995)

Hong-Jian Lai: The size of graphs without nowhere-zero 4-flows. Journal of Graph Theory 19(3): 385-395 (1995)

Hong-Jian Lai: Every 4-Connected Line Graph of a Planar Graph is Hamiltonian. Graphs and Combinatorics 10(2-4): 249-253 (1994)

Hong-Jian Lai, Xingxing Yu, Cun-Quan Zhang: Small Circuit Double Covers of Cubic Multigraphs. J. Comb. Theory, Ser. B 60(2): 177-194 (1994)

Hong-Jian Lai, Cun-Quan Zhang: Edge-maximal (k, i)-graphs. Journal of Graph Theory 18(3): 227-240 (1994)

Hong-Jian Lai: Supereulerian complementary graphs. Journal of Graph Theory 17(2): 263-273 (1993)

Zhi-Hong Chen, Hong-Jian Lai: Collapsible graphs and matchings. Journal of Graph Theory 17(5): 597-605 (1993)

Paul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai: Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids. Discrete Applied Mathematics 40(3): 285-302 (1992)

Hong-Jian Lai, Hongyuan Lai: Duality in graph families. Discrete Mathematics 110(1-3): 165-177 (1992)

Hong-Jian Lai, Cun-Quan Zhang: Nowhere-zero 3-flows of highly connected graphs. Discrete Mathematics 110(1-3): 179-183 (1992)

Hong-Jian Lai: Graph whose edges are in small cycles. Discrete Mathematics 94(1): 11-22 (1991)

Hong-Jian Lai: Reduced graphs of diameter two. Journal of Graph Theory 14(1): 77-87 (1990)

Hong-Jian Lai: The size of strength-maximal graphs. Journal of Graph Theory 14(2): 187-197 (1990)

Hong-Jian Lai: Unique graph homomorphisms onto odd cycles, II. J. Comb. Theory, Ser. B 46(3): 363-376 (1989)

Hong-Jian Lai: On the Hamiltonian index. Discrete Mathematics 69(1): 43-53 (1988)

Hong-Jian Lai: Contractions and hamiltonian line graphs. Journal of Graph Theory 12(1): 11-15 (1988)