| 2009 |
|---|
| 13 | 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) |
| 12 | 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 |
|---|
| 11 | EE | Dengxin Li,
Hong-Jian Lai,
Yehong Shao,
Mingquan Zhan:
Hamiltonian connected hourglass free line graphs.
Discrete Mathematics 308(12): 2634-2636 (2008) |
| 10 | EE | Hong-Jian Lai,
Yanting Liang,
Yehong Shao:
On s-hamiltonian-connected line graphs.
Discrete Mathematics 308(18): 4293-4297 (2008) |
| 9 | EE | Zhang Lili,
Elaine M. Eschen,
Hong-Jian Lai,
Yehong Shao:
The s-Hamiltonian index.
Discrete Mathematics 308(20): 4779-4785 (2008) |
| 8 | 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) |
| 7 | EE | Suohai Fan,
Hong-Jian Lai,
Yehong Shao,
Taoye Zhang,
Ju Zhou:
Degree sequence and supereulerian graphs.
Discrete Mathematics 308(24): 6626-6631 (2008) |
| 6 | 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) |
| 2007 |
|---|
| 5 | EE | Dengxin Li,
Hong-Jian Lai,
Yehong Shao,
Mingquan Zhan:
Hamiltonian Connected Line Graphs.
International Conference on Computational Science (3) 2007: 377-380 |
| 4 | EE | Kewen Zhao,
Hong-Jian Lai,
Yehong Shao:
New sufficient condition for Hamiltonian graphs.
Appl. Math. Lett. 20(1): 116-122 (2007) |
| 2006 |
|---|
| 3 | 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) |
| 2 | 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) |
| 2005 |
|---|
| 1 | EE | Hong-Jian Lai,
Yehong Shao,
Mingquan Zhan:
Hamiltonian N2-locally connected claw-free graphs.
Journal of Graph Theory 48(2): 142-146 (2005) |
