Now showing items 1-2 of 2

    • Collapsible graphs and Hamiltonian connectedness of line graphs 

      Yang, Weihua; Lai, Hongjian; Li, Hao; Guo, Xiaofeng; 郭晓峰 (ELSEVIER SCIENCE BV, 2012-08)
      Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics an update, in: Ku Tung-Hsin (Ed.), Combinatorics ...
    • Hamiltonicity of 3-connected line graphs 

      Yang, Weihua; Xiong, Liming; Lai, Hongjian; Guo, Xiaofeng; 郭晓峰 (PERGAMON-ELSEVIER SCIENCE LTD, 2012-10)
      Thomassen conjectured that every 4-connected line graph is Hamiltonian. Lai et al. conjectured [H. Lai, Y. Shao, H. Wu, J. Zhou, Every 3-connected, essentially 11-connected line graph is Hamiltonian, J. Combin. Theory Ser. ...