{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:57:05Z","timestamp":1725638225675},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_11","type":"book-chapter","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T19:32:34Z","timestamp":1322854354000},"page":"90-99","source":"Crossref","is-referenced-by-count":1,"title":["Hamiltonian Paths in the Square of a Tree"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Radoszewski","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0012-365X(99)00115-6","volume":"207","author":"M.E.K. Abderrezzak","year":"1999","unstructured":"Abderrezzak, M.E.K., Flandrin, E., Ryj\u00e1\u010dek, Z.: Induced S(K\n                    \n                      \n                    \n                    $_{\\mbox{1, 3}}$\n                  ) and Hamiltonian cycles in the square of a graph. Discrete Mathematics\u00a0207(1-3), 263\u2013269 (1999)","journal-title":"Discrete Mathematics"},{"key":"11_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R. Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory, 4th edn. Springer, Heidelberg (2010)","edition":"4"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0095-8956(74)90091-4","volume":"16","author":"H. Fleischner","year":"1974","unstructured":"Fleischner, H.: The square of every two-connected graph is Hamiltonian. J. Combin. Theory (Series B)\u00a016, 29\u201334 (1974)","journal-title":"J. Combin. Theory (Series B)"},{"issue":"23-24","key":"11_CR4","doi-asserted-by":"publisher","first-page":"6632","DOI":"10.1016\/j.disc.2009.06.024","volume":"309","author":"A. Georgakopoulos","year":"2009","unstructured":"Georgakopoulos, A.: A short proof of Fleischner\u2019s theorem. Discrete Mathematics\u00a0309(23-24), 6632\u20136634 (2009)","journal-title":"Discrete Mathematics"},{"key":"11_CR5","unstructured":"Georgakopoulos, A.: Infinite Hamilton cycles in squares of locally finite graphs (2006) (preprint)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1112\/S0025579300008494","volume":"18","author":"F. Harary","year":"1971","unstructured":"Harary, F., Schwenk, A.: Trees with Hamiltonian square. Mathematika\u00a018, 138\u2013140 (1971)","journal-title":"Mathematika"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1002\/jgt.3190090415","volume":"9","author":"G. Hendry","year":"1985","unstructured":"Hendry, G., Vogler, W.: The square of a S(K\n                    \n                      \n                    \n                    $_{\\mbox{1, 3}}$\n                  )-free graph is vertex pancyclic. Journal of Graph Theory\u00a09, 535\u2013537 (1985)","journal-title":"Journal of Graph Theory"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.4153\/CMB-1968-037-0","volume":"11","author":"J.J. Karaganis","year":"1968","unstructured":"Karaganis, J.J.: On the cube of a graph. Canad. Math. Bull.\u00a011, 295\u2013296 (1968)","journal-title":"Canad. Math. Bull."},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S089548019120016X","volume":"8","author":"Y.-L. Lin","year":"1995","unstructured":"Lin, Y.-L., Skiena, S.: Algorithms for square roots of graphs. SIAM J. Discrete Math.\u00a08(1), 99\u2013118 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR10","unstructured":"Sekanina, M.: On an ordering of the set of vertices of a connected graph. Technical Report 412, Publ. Fac. Sci. Univ. Brno. (1960)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0167-5060(08)70512-0","volume":"3","author":"C. Thomassen","year":"1978","unstructured":"Thomassen, C.: Hamiltonian paths in squares of infinite locally finite blocks. Annals of Discr. Math.\u00a03, 269\u2013277 (1978)","journal-title":"Annals of Discr. Math."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0095-8956(91)90098-5","volume":"52","author":"S. \u0158iha","year":"1991","unstructured":"\u0158iha, S.: A new proof of the theorem by Fleischner. J. Comb. Theory Ser. B\u00a052, 117\u2013123 (1991)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T03:12:42Z","timestamp":1538709162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}