{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T18:07:22Z","timestamp":1693764442322},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T00:00:00Z","timestamp":1334016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s00373-012-1161-3","type":"journal-article","created":{"date-parts":[[2012,4,9]],"date-time":"2012-04-09T08:55:49Z","timestamp":1333961749000},"page":"795-834","source":"Crossref","is-referenced-by-count":5,"title":["An Ore-Type Theorem on Hamiltonian Square Cycles"],"prefix":"10.1007","volume":"29","author":[{"given":"Phong","family":"Ch\u00e2u","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,10]]},"reference":[{"key":"1161_CR1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1112\/jlms\/s2-48.1.39","volume":"48","author":"M. Aigner","year":"1993","unstructured":"Aigner M., Brandt S.: Embedding arbitrary graphs of maximum degree two. J. Lond. Math. Soc. 48, 39\u201351 (1993)","journal-title":"J. Lond. Math. Soc."},{"key":"1161_CR2","unstructured":"Ch\u00e2u, P.: An Ore-type version of P\u00f3sa\u2019s conjecture (2009, manuscript)"},{"issue":"4","key":"1161_CR3","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 \u00d7\u00a0108. Random Struct. Algorithms 39(4), 507\u2013525 (2011)","journal-title":"Random Struct. Algorithms"},{"key":"1161_CR4","first-page":"68","volume":"2","author":"G.A. Dirac","year":"1952","unstructured":"Dirac G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 68\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1161_CR5","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s P.: Problem 9, Theory of Graphs and its Applications (M. Fielder ed.), Czech. Acad. Sci. Publ., Prague, p. 159 (1964)","DOI":"10.1137\/1109026"},{"issue":"2","key":"1161_CR6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/S0895480192232254","volume":"7","author":"G.H. Fan","year":"1994","unstructured":"Fan G.H., H\u00e4ggkvist R.: The square of a hamiltonian cycle. SIAM J. Discrete Math. 7(2), 203\u2013212 (1994)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"1161_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/jctb.1995.1005","volume":"63","author":"G.H. Fan","year":"1995","unstructured":"Fan G.H., Kierstead H.A.: The square of paths and cycles. J. Comb. Theory Ser. B 63(1), 55\u201364 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"1161_CR8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1006\/jctb.1996.0039","volume":"67","author":"G.H. Fan","year":"1996","unstructured":"Fan G.H., Kierstead H.A.: Hamiltonian square paths. J. Comb. Theory Ser. B 67(2), 167\u2013182 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"1161_CR9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/(SICI)1097-0118(199611)23:3<241::AID-JGT4>3.0.CO;2-S","volume":"23","author":"G.H. Fan","year":"1996","unstructured":"Fan G.H., Kierstead H.A.: Partitioning a graph into two square-cycles. J. Graph Theory 23(3), 241\u2013256 (1996)","journal-title":"J. Graph Theory"},{"key":"1161_CR10","unstructured":"Faudree, R.J., Gould, R.J., Jacobson, M.S., Schelp, R.: Seymour\u2019s Conjecture. Advances in Graph Theory. In: Kulli, V.R. (ed.) Vishwa, Gulbarga, pp. 163\u2013171 (1991)"},{"key":"1161_CR11","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of P. Erd\u00f6s. Combinatorial Theory and its Applications, pp. 601\u2013623. North-Holland (1970)"},{"issue":"2","key":"1161_CR12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1017\/S0963548307008619","volume":"17","author":"H.A. Kierstead","year":"2008","unstructured":"Kierstead H.A., Kostochka A.V.: A short proof of the Hajnal\u2013Szemer\u00e9di Theorem on equitable coloring. Comb. Prob. Comput. 17(2), 265\u2013270 (2008)","journal-title":"Comb. Prob. Comput."},{"issue":"1","key":"1161_CR13","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.jctb.2007.07.003","volume":"98","author":"H.A. Kierstead","year":"2008","unstructured":"Kierstead H.A., Kostochka A.V.: An Ore-type theorem on equitable coloring. J. Comb. Theory Ser. B 98(1), 226\u2013234 (2008)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1161_CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J. Koml\u00f3s","year":"1997","unstructured":"Koml\u00f3s J., S\u00e1rk\u00f6zy G.N., Szemer\u00e9di E.: Blow-up lemma. Combinatorica 17, 109\u2013123 (1997)","journal-title":"Combinatorica"},{"issue":"1-2","key":"1161_CR15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<193::AID-RSA12>3.0.CO;2-P","volume":"9","author":"J. Koml\u00f3s","year":"1996","unstructured":"Koml\u00f3s J., S\u00e1rk\u00f6zy G.N., Szemer\u00e9di E.: On the square of a hamiltonian cycle in dense graphs. Random Struct Algorithms 9(1-2), 193\u2013211 (1996)","journal-title":"Random Struct Algorithms"},{"issue":"1","key":"1161_CR16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01626028","volume":"2","author":"J. Koml\u00f3s","year":"1998","unstructured":"Koml\u00f3s J., S\u00e1rk\u00f6zy G.N., Szemer\u00e9di E.: Proof of the Seymour conjecture for large graphs. Ann. Comb. 2(1), 43\u201360 (1998)","journal-title":"Ann. Comb."},{"key":"1161_CR17","first-page":"295","volume":"2","author":"J. Koml\u00f3s","year":"1996","unstructured":"Koml\u00f3s J., Simonovits M.: Szemer\u00e9di\u2019s regularity lemma and its applications in graph theory. Combinatorics: Paul Erd\u00f6s is eighty 2, 295\u2013352 (1996)","journal-title":"Combinatorics: Paul Erd\u00f6s is eighty"},{"key":"1161_CR18","unstructured":"Kostochka, A.V., Yu, G.: Extremal problems on packing of graphs. Oberwolfach reports, No 1, pp. 55\u201357 (2006)"},{"issue":"1","key":"1161_CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1017\/S0963548306007899","volume":"16","author":"A.V. Kostochka","year":"2007","unstructured":"Kostochka A.V., Yu G.: Ore-type graph packing problems. Comb. Prob. Comput. 16(1), 167\u2013169 (2007)","journal-title":"Comb. Prob. Comput."},{"key":"1161_CR20","unstructured":"Kostochka, A.V., Yu, G.: Graphs containing every 2-factor. Graphs and Combinatorics (to appear)"},{"issue":"3","key":"1161_CR21","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1137\/080731256","volume":"23","author":"D. K\u00fchn","year":"2009","unstructured":"K\u00fchn D., Osthus D., Treglown A.: An Ore-type theorem for perfect packings in graphs. SIAM J. Discrete Math. 23(3), 1335\u20131355 (2009)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"1161_CR22","doi-asserted-by":"crossref","first-page":"610","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. Discrete Math. 310(3), 610\u2013641 (2010)","journal-title":"Discrete Math."},{"key":"1161_CR23","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O. Ore","year":"1960","unstructured":"Ore O.: Note on Hamilton circuits. Am. Math. Mon. 67, 55 (1960)","journal-title":"Am. Math. Mon."},{"key":"1161_CR24","unstructured":"Seymour, P.: Problem section in Combinatorics. In: McDonough, T.P., Mavron, V.C. (eds.) Proceedings of the British Combinatorial Conference 1973, pp. 201\u2013202. Cambridge University Press, Cambridge (1974)"},{"key":"1161_CR25","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. Colloques Internationaux C.N.R.S. No. 260-Problemes Combinatoires et Theorie des Graphes, Orsay, pp. 399\u2013401 (1976)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1161-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1161-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1161-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T13:39:39Z","timestamp":1641994779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1161-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,10]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1161"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1161-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,10]]}}}