2009 |
64 | EE | 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) |
63 | EE | 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) |
62 | EE | 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) |
2008 |
61 | | 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) |
60 | | Jingjing Chen,
Elaine M. Eschen,
Hong-Jian Lai:
Group connectivity of certain graphs.
Ars Comb. 89: (2008) |
59 | EE | Dengxin Li,
Hong-Jian Lai,
Yehong Shao,
Mingquan Zhan:
Hamiltonian connected hourglass free line graphs.
Discrete Mathematics 308(12): 2634-2636 (2008) |
58 | EE | Hong-Jian Lai,
Yanting Liang,
Yehong Shao:
On s-hamiltonian-connected line graphs.
Discrete Mathematics 308(18): 4293-4297 (2008) |
57 | EE | Zhang Lili,
Elaine M. Eschen,
Hong-Jian Lai,
Yehong Shao:
The s-Hamiltonian index.
Discrete Mathematics 308(20): 4779-4785 (2008) |
56 | EE | 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) |
55 | EE | Suohai Fan,
Hong-Jian Lai,
Yehong Shao,
Taoye Zhang,
Ju Zhou:
Degree sequence and supereulerian graphs.
Discrete Mathematics 308(24): 6626-6631 (2008) |
54 | EE | Hong-Jian Lai,
Bolian Liu,
Yan Liu,
Yehong Shao:
Spanning cycles in regular matroids without M*(K5) minors.
Eur. J. Comb. 29(1): 298-310 (2008) |
53 | EE | 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) |
2007 |
52 | EE | Dengxin Li,
Hong-Jian Lai,
Yehong Shao,
Mingquan Zhan:
Hamiltonian Connected Line Graphs.
International Conference on Computational Science (3) 2007: 377-380 |
51 | EE | Kewen Zhao,
Hong-Jian Lai,
Yehong Shao:
New sufficient condition for Hamiltonian graphs.
Appl. Math. Lett. 20(1): 116-122 (2007) |
50 | EE | Hong-Jian Lai,
Rui Xu,
Cun-Quan Zhang:
On Circular Flows Of Graphs.
Combinatorica 27(2): 245-246 (2007) |
49 | EE | Hong-Jian Lai,
Xiangwen Li,
Gexin Yu:
An inequality for the group chromatic number of a graph.
Discrete Mathematics 307(23): 3076-3080 (2007) |
48 | EE | MingChu Li,
Cheng Guo,
Liming Xiong,
Dengxin Li,
Hong-Jian Lai:
Quadrangularly connected claw-free graphs.
Discrete Mathematics 307(9-10): 1205-1211 (2007) |
47 | EE | Hong-Jian Lai,
Xiangjuan Yao:
Erratum to "Collapsible biclaw-free graphs": [Discrete Math 306 (2006) 2115-2117].
Discrete Mathematics 307(9-10): 1217 (2007) |
46 | EE | Hong-Jian Lai:
Mod (2p + 1)-Orientations and $K1,2p+1-Decompositions.
SIAM J. Discrete Math. 21(4): 844-850 (2007) |
2006 |
45 | EE | Hong-Jian Lai,
Jianliang Lin,
Bruce Montgomery,
Taozhi Shui,
Suohai Fan:
Conditional colorings of graphs.
Discrete Mathematics 306(16): 1997-2004 (2006) |
44 | EE | Hong-Jian Lai,
Xiangjuan Yao:
Collapsible biclaw-free graphs.
Discrete Mathematics 306(17): 2115-2117 (2006) |
43 | EE | Hong-Jian Lai,
Xiangjuan Yao:
Group connectivity of graphs with diameter at most 2.
Eur. J. Comb. 27(3): 436-443 (2006) |
42 | EE | Hong-Jian Lai,
Yehong Shao,
Mingquan Zhan:
Hamiltonicity in 3-connected claw-free graphs.
J. Comb. Theory, Ser. B 96(4): 493-504 (2006) |
41 | EE | 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) |
40 | EE | 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) |
2005 |
39 | | Hong-Jian Lai,
Deying Li,
Jingzhong Mao,
Mingquan Zhan:
Supereulerian planar graphs.
Ars Comb. 75: (2005) |
38 | EE | Dengxin Li,
Hong-Jian Lai,
Mingquan Zhan:
Eulerian subgraphs and Hamilton-connected line graphs.
Discrete Applied Mathematics 145(3): 422-428 (2005) |
37 | EE | Hong-Jian Lai,
Xiangwen Li,
Hoifung Poon,
Yongbin Ou:
Spanning Trails Connecting Given Edges.
Graphs and Combinatorics 21(1): 77-88 (2005) |
36 | EE | Hong-Jian Lai,
Xiangwen Li:
On Group Chromatic Number of Graphs.
Graphs and Combinatorics 21(4): 469-474 (2005) |
35 | EE | Hong-Jian Lai,
Yehong Shao,
Mingquan Zhan:
Hamiltonian N2-locally connected claw-free graphs.
Journal of Graph Theory 48(2): 142-146 (2005) |
34 | EE | Hong-Jian Lai,
Xiangwen Li,
Hoifung Poon:
Nowhere zero 4-flow in regular matroids.
Journal of Graph Theory 49(3): 196-204 (2005) |
2004 |
33 | EE | 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) |
32 | EE | Xiaofan Yang,
David J. Evans,
Hong-Jian Lai,
Graham M. Megson:
Generalized honeycomb torus is Hamiltonian.
Inf. Process. Lett. 92(1): 31-37 (2004) |
31 | EE | 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) |
2003 |
30 | | Hong-Jian Lai,
Bruce Montgomery,
Hoifung Poon:
Upper Bounds of Dynamic Chromatic Number.
Ars Comb. 68: (2003) |
29 | EE | Hong-Jian Lai,
Xiangwen Li:
Small cycle cover of 2-connected cubic graphs.
Discrete Mathematics 269(1-3): 295-302 (2003) |
2002 |
28 | | Hong-Jian Lai,
Xiankun Zhang:
Group Colorability of Graphs.
Ars Comb. 62: (2002) |
27 | EE | Hong-Jian Lai,
Hoifung Poon:
Cycle Cover Ratio of Regular Matroids.
Eur. J. Comb. 23(8): 1007-1014 (2002) |
26 | EE | Hong-Jian Lai,
Xiankun Zhang:
Group Chromatic Number of Graphs without K5-Minors.
Graphs and Combinatorics 18(1): 147-154 (2002) |
2001 |
25 | EE | Arthur M. Hobbs,
Hong-Jian Lai:
Dedication.
Discrete Mathematics 230(1-3): 1- (2001) |
24 | EE | Zhi-Hong Chen,
Hong-Jian Lai,
Hongyuan Lai:
Nowhere zero flows in line graphs.
Discrete Mathematics 230(1-3): 133-141 (2001) |
23 | EE | Arthur M. Hobbs,
Hong-Jian Lai,
Neil Robertson:
Paul Catlin 1948-1995.
Discrete Mathematics 230(1-3): 3-12 (2001) |
22 | EE | Hong-Jian Lai:
Eulerian subgraphs containing given edges.
Discrete Mathematics 230(1-3): 63-69 (2001) |
21 | EE | Paul A. Catlin,
Arthur M. Hobbs,
Hong-Jian Lai:
Graph family operations.
Discrete Mathematics 230(1-3): 71-97 (2001) |
20 | EE | Hong-Jian Lai,
Lubomír Soltés:
Line Graphs and Forbidden Induced Subgraphs.
J. Comb. Theory, Ser. B 82(1): 38-55 (2001) |
2000 |
19 | | Hong-Jian Lai,
Xiankun Zhang:
Spanning trails that join given edges in 3-edge-connected graphs.
Ars Comb. 57: (2000) |
1999 |
18 | | Zhi-Hong Chen,
Kuang Ying-Qiang,
Hong-Jian Lai:
Connectivity of cycle matroids and bicircular matroids.
Ars Comb. 52: (1999) |
1998 |
17 | | Zhi-Hong Chen,
Hong-Jian Lai:
Supereulerian graphs and the Petersen Graph, II.
Ars Comb. 48: (1998) |
16 | EE | Hong-Jian Lai:
Eulerian subgraphs containing given vertices and hamiltonian line graphs.
Discrete Mathematics 178(1-3): 93-107 (1998) |
1996 |
15 | EE | Paul A. Catlin,
Zheng-Yiao Han,
Hong-Jian Lai:
Graphs without spanning closed trails.
Discrete Mathematics 160(1-3): 81-91 (1996) |
14 | EE | Hong-Jian Lai,
Hongyuan Lai,
Charles Payan:
A Property on Edge-disjoint Spanning Trees.
Eur. J. Comb. 17(5): 447-450 (1996) |
13 | EE | Paul A. Catlin,
Hong-Jian Lai:
Supereulerian Graphs and the Petersen Graph.
J. Comb. Theory, Ser. B 66(1): 123-139 (1996) |
1995 |
12 | EE | Hong-Jian Lai:
Large Survivable Nets and the Generalized Prisms.
Discrete Applied Mathematics 61(2): 181-185 (1995) |
11 | EE | Hong-Jian Lai,
Hongyuan Lai:
Every Matroid Is a Submatroid of a Uniformly Dense Matroid.
Discrete Applied Mathematics 63(2): 151-160 (1995) |
10 | EE | Paul A. Catlin,
Hong-Jian Lai:
Vertex arboricity and maximum degree.
Discrete Mathematics 141(1-3): 37-46 (1995) |
9 | EE | Hong-Jian Lai,
Guoqing Weng:
Strength and fractional arboricity of complementary graphs.
Discrete Mathematics 143(1-3): 141-151 (1995) |
8 | EE | Hong-Jian Lai:
Supereulerian graphs and excluded induced minors.
Discrete Mathematics 146(1-3): 133-143 (1995) |
1994 |
7 | EE | 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) |
1992 |
6 | | 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) |
5 | EE | Hong-Jian Lai,
Hongyuan Lai:
Duality in graph families.
Discrete Mathematics 110(1-3): 165-177 (1992) |
4 | EE | Hong-Jian Lai,
Cun-Quan Zhang:
Nowhere-zero 3-flows of highly connected graphs.
Discrete Mathematics 110(1-3): 179-183 (1992) |
1991 |
3 | EE | Hong-Jian Lai:
Graph whose edges are in small cycles.
Discrete Mathematics 94(1): 11-22 (1991) |
1989 |
2 | EE | Hong-Jian Lai:
Unique graph homomorphisms onto odd cycles, II.
J. Comb. Theory, Ser. B 46(3): 363-376 (1989) |
1988 |
1 | EE | Hong-Jian Lai:
On the Hamiltonian index.
Discrete Mathematics 69(1): 43-53 (1988) |