| 2012 | ||
|---|---|---|
| j23 | Kewen Zhao, Lili Zhang, Hong-Jian Lai, Yehong Shao: Hamiltonian graphs involving neighborhood conditions. Ars Comb. 105: 161-170 (2012) | |
| j22 | Xiangwen Li, Hong-Jian Lai, Yehong Shao: Degree condition and Z3-connectivity. Discrete Mathematics 312(10): 1658-1669 (2012) | |
| j21 | 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) | |
| j20 | Lili Zhang, Yehong Shao, Guihai Chen, Xinping Xu, Ju Zhou: s-Vertex Pancyclic Index. Graphs and Combinatorics 28(3): 393-406 (2012) | |
| 2011 | ||
| j19 | 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) | |
| j18 | Hong-Jian Lai, Hao Li, Yehong Shao, Mingquan Zhan: On 3-Edge-Connected Supereulerian Graphs. Graphs and Combinatorics 27(2): 207-214 (2011) | |
| 2010 | ||
| j17 | Hong-Jian Lai, Mingchu Li, Yehong Shao, Liming Xiong: Spanning eulerian subgraphs in N2-locally connected claw-free graphs. Ars Comb. 94 (2010) | |
| j16 | Yehong Shao: Connectivity of iterated line graphs. Discrete Applied Mathematics 158(18): 2081-2087 (2010) | |
| j15 | Xiaoxia Zhang, Mingquan Zhan, Rui Xu, Yehong Shao, Xiangwen Li, Hong-Jian Lai: Degree sum condition for Z3-connectivity in graphs. Discrete Mathematics 310(23): 3390-3397 (2010) | |
| 2009 | ||
| j14 | Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan: Hamiltonian connectedness in 3-connected line graphs. Discrete Applied Mathematics 157(5): 982-990 (2009) | |
| j13 | Paul A. Catlin, Hong-Jian Lai, Yehong Shao: Edge-connectivity and edge-disjoint spanning trees. Discrete Mathematics 309(5): 1033-1040 (2009) | |
| j12 | 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) | |
| j11 | 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 | ||
| j10 | Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan: Hamiltonian connected hourglass free line graphs. Discrete Mathematics 308(12): 2634-2636 (2008) | |
| j9 | Hong-Jian Lai, Yanting Liang, Yehong Shao: On s-hamiltonian-connected line graphs. Discrete Mathematics 308(18): 4293-4297 (2008) | |
| j8 | Lili Zhang, Elaine M. Eschen, Hong-Jian Lai, Yehong Shao: The s-Hamiltonian index. Discrete Mathematics 308(20): 4779-4785 (2008) | |
| j7 | 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) | |
| j6 | Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang, Ju Zhou: Degree sequence and supereulerian graphs. Discrete Mathematics 308(24): 6626-6631 (2008) | |
| j5 | 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 | ||
| j4 | Kewen Zhao, Hong-Jian Lai, Yehong Shao: New sufficient condition for Hamiltonian graphs. Appl. Math. Lett. 20(1): 116-122 (2007) | |
| c1 | Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan: Hamiltonian Connected Line Graphs. International Conference on Computational Science (3) 2007: 377-380 | |
| 2006 | ||
| j3 | Hong-Jian Lai, Yehong Shao, Mingquan Zhan: Hamiltonicity in 3-connected claw-free graphs. J. Comb. Theory, Ser. B 96(4): 493-504 (2006) | |
| j2 | 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 | ||
| j1 | Hong-Jian Lai, Yehong Shao, Mingquan Zhan: Hamiltonian N2-locally connected claw-free graphs. Journal of Graph Theory 48(2): 142-146 (2005) | |
Data released under the ODC-BY 1.0 license — See also our legal information page