Search the dblp DataBase

Publications of Author

1. Kewen Zhao, Hong-Jian Lai, Yehong Shao
   New sufficient condition for Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
   Appl. Math. Lett., 2007, v:20, n:1, pp:116-122 [Journal]
   
2. Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou
   Every 3-connected, essentially 11-connected line graph is Hamiltonian. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:571-576 [Journal]
   
3. Hong-Jian Lai, Yehong Shao, Mingquan Zhan
   Hamiltonicity in 3-connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:493-504 [Journal]
   
4. Hong-Jian Lai, Yehong Shao, Mingquan Zhan
   Hamiltonian N₂-locally connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2005, v:48, n:2, pp:142-146 [Journal]
   
5. Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan
   Hamiltonian Connected Line Graphs. [Citation Graph (0, 0)][DBLP]
   International Conference on Computational Science (3), 2007, pp:377-380 [Conf]
   
6. 
   Hamiltonian connectedness in 3-connected line graphs. [Citation Graph (, )][DBLP]
   
   
7. 
   Degree sequence and supereulerian graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   Hamiltonian connected hourglass free line graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   On s-hamiltonian-connected line graphs. [Citation Graph (, )][DBLP]
   
   
10. 
    Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected. [Citation Graph (, )][DBLP]
    
    
11. 
    The s-Hamiltonian index. [Citation Graph (, )][DBLP]
    
    
12. 
    Edge-connectivity and edge-disjoint spanning trees. [Citation Graph (, )][DBLP]
    
    
13. 
    Spanning cycles in regular matroids without M^*(K₅) minors. [Citation Graph (, )][DBLP]
    
    
14. 
    Every line graph of a 4-edge-connected graph is I-connected. [Citation Graph (, )][DBLP]