Two types of path structures of graphs

References

• Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , New York : W.H. Freeman and Company .
   Google Scholar
• Kamrul , Hasan Md. and Kaykobad , M. 2010 . Young-Koo Lee, Sungyoung Lee, Note: A comprehensive analysis of degree based condition for Hamiltonian cycles . Theoretical Computer Science , 411 ( 1 ) : 285 – 287 .
   Google Scholar
• Rao , Li . 2006 . A new suff icient condition for Hamiltonicity of graphs . Information Processing Letters , 98 ( 4 ) : 159 – 161 .
   Google Scholar
• Rahman , M. and Kaykobad , M. 2005 . On Hamiltonian cycles and Hamiltonian paths . Inform. Process. Lett , 94 ( 1 ) : 37 – 41 .
   Google Scholar
• Kewen , Zhao , Yue , Lin and Ping , Zhang . 2009 . A Suff icient Condition for Pancyclic Graphs . Information Processing Letters , 109 ( 16 ) : 991 – 996 .
   Google Scholar
• Kewen , Zhao , Hongjian , Laoi and Ju , Zhou . 2008 . Hamiltonian-connected graphs . Computers Math. Appl , 55 ( 12 ) : 2707 – 2714 .
   Google Scholar