{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:30:08Z","timestamp":1648683008258},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T00:00:00Z","timestamp":1421107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00373-015-1524-7","type":"journal-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T06:40:44Z","timestamp":1421044844000},"page":"2113-2124","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Characterizing Forbidden Pairs for Hamiltonian Squares"],"prefix":"10.1007","volume":"31","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songling","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,13]]},"reference":[{"key":"1524_CR1","unstructured":"Bedrossian, P.M.: Forbidden subgraph and minimum degree conditions for hamiltonicity. ProQuest LLC, Ann Arbor, MI,. Thesis (Ph.D.)-Memphis State University (1991)"},{"issue":"4","key":"1524_CR2","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/rsa.20376","volume":"39","author":"P Ch\u00e2u","year":"2011","unstructured":"Ch\u00e2u, P., DeBiasio, L., Kierstead, H.A.: P\u00f3sa\u2019s conjecture for graphs of order at least $$2\\times 10^8$$ 2 \u00d7 10 8 . Random Struct. Algorithms 39(4), 507\u2013525 (2011)","journal-title":"Random Struct. Algorithms"},{"key":"1524_CR3","unstructured":"Duffus, D., Jacobson, M.S., Gould, R.J.: Forbidden subgraphs and the Hamiltonian theme. In: The theory and applications of graphs (Kalamazoo, Mich., 1980), pp. 297\u2013316. Wiley, New York (1981)"},{"key":"1524_CR4","unstructured":"Erd\u0151s, P: Problem 9. In: Fiedler, M., (ed.) Theory of Graphs and Its Applications, Proceedings of the Symposium held in Smolenice in June 1963, p. 159. Prague, Czechoslovakia: Publishing House of the Czechoslovak Academy of Sciences (1964)"},{"issue":"2","key":"1524_CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/S0895480192232254","volume":"7","author":"G Fan","year":"1994","unstructured":"Fan, G., H\u00e4ggkvist, R.: The square of a Hamiltonian cycle. SIAM J. Discret. Math. 7(2), 203\u2013212 (1994)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"1524_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/jctb.1995.1005","volume":"63","author":"G Fan","year":"1995","unstructured":"Fan, G., Kierstead, H.A.: The square of paths and cycles. J. Combin. Theory Ser. B 63(1), 55\u201364 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"1524_CR7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1006\/jctb.1996.0039","volume":"67","author":"G Fan","year":"1996","unstructured":"Fan, G., Kierstead, H.A.: Hamiltonian square-paths. J. Combin. Theory Ser. B 67(2), 167\u2013182 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1\u20133","key":"1524_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0012-365X(96)00147-1","volume":"173","author":"RJ Faudree","year":"1997","unstructured":"Faudree, R.J., Gould, R.J.: Characterizing forbidden pairs for Hamiltonian properties. Discret. Math. 173(1\u20133), 45\u201360 (1997)","journal-title":"Discret. Math."},{"issue":"4","key":"1524_CR9","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/j.disc.2012.11.015","volume":"313","author":"M Ferrara","year":"2013","unstructured":"Ferrara, M., Gehrke, S., Gould, R., Magnant, C., Powell, J.: Pancyclicity of 4-connected claw, generalized bull-free graphs. Discret. Math. 313(4), 460\u2013467 (2013)","journal-title":"Discret. Math."},{"issue":"4","key":"1524_CR10","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1002\/jgt.21626","volume":"71","author":"M Ferrara","year":"2012","unstructured":"Ferrara, M., Morris, T., Wenger, P.: Pancyclicity of 4-connected, claw-free, $$P_{10}$$ P 10 -free graphs. J. Graph Theory 71(4), 435\u2013447 (2012)","journal-title":"J. Graph Theory"},{"key":"1524_CR11","unstructured":"Gehrke, S.: Hamiltonicity and pancyclicity of 4-connected, claw- and net-free graphs. ProQuest LLC, Ann Arbor, MI. Thesis (Ph.D.)-Emory University (2009)"},{"key":"1524_CR12","unstructured":"Koml\u00f3s, J., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: On the square of a Hamiltonian cycle in dense graphs. In: Proceedings of the Seventh International Conference on Random Structures and Algorithms (Atlanta, GA, 1995), vol. 9, pp. 193\u2013211 (1996)"},{"issue":"3","key":"1524_CR13","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1016\/j.disc.2009.05.020","volume":"310","author":"I Levitt","year":"2010","unstructured":"Levitt, I., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: How to avoid using the regularity lemma: P\u00f3sa\u2019s conjecture revisited. Discret. Math. 310(3), 630\u2013641 (2010)","journal-title":"Discret. Math."},{"key":"1524_CR14","unstructured":"Seymour, P.: Problem section. In: McDonough, T.P., Mavron, V.C. (eds.) Combinatorics: Proceedings of the British Combinatorial Conference 1973, pp. 201\u2013202. Cambridge University Press (1974)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1524-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1524-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1524-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:39Z","timestamp":1559041179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1524-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,13]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["1524"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1524-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,13]]}}}