-
[1] Y. Alavi and J.E. Williamson, Panconnected graphs, Studia Sci. Math. Hungar. 10 (1975) 19-22.
-
[2] H.C. Chan, J.M. Chang, Y.L. Wang and S.J. Horng, Geodesic-pancyclic graphs, Discrete Appl. Math. 155 (2007) 1971-1978.
-
[3] G. Chartrand, F. Fujie and P. Zhang, On an extension of an observation of Hamilton, J. Combin. Math. Combin. Comput., to appear.
-
[4] G. Chartrand, A.M. Hobbs, H.A. Jung, S.F. Kapoor and C.St.J.A. Nash-Williams, The square of a block is Hamiltonian connected, J. Combin. Theory (B) 16 (1974) 290-292. doi:10.1016/0095-8956(74)90075-6[Crossref]
-
[5] G. Chartrand and S.F. Kapoor, The cube of every connected graph is 1-hamiltonian, J. Res. Nat. Bur. Standards B 73 (1969) 47-48. doi:10.6028/jres.073B.007
-
[6] G. Chartrand, L. Lesniak and P. Zhang, Graphs & Digraphs: 5th Edition (Chapman & Hall/CRC, Boca Raton, FL, 2010).
-
[7] G.A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2 (1952) 69-81. doi:10.1112/plms/s3-2.1.69[Crossref]
-
[8] R.J. Faudree and R.H. Schelp, Path connected graphs, Acta Math. Acad. Sci. Hun- gar. 25 (1974) 313-319. doi:10.1007/BF01886090[Crossref]
-
[9] H. Fleischner, The square of every two-connected graph is Hamiltonian, J. Combin. Theory (B) 16 (1974) 29-34. doi:10.1016/0095-8956(74)90091-4[Crossref]
-
[10] C.St.J.A. Nash-Williams, Problem No. 48, in: Theory of Graphs and its Applica- tions, (Academic Press, New York 1968), 367.