{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:41:17Z","timestamp":1758271277484},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,7,12]],"date-time":"2011-07-12T00:00:00Z","timestamp":1310428800000},"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":[[2012,9]]},"DOI":"10.1007\/s00373-011-1066-6","type":"journal-article","created":{"date-parts":[[2011,7,11]],"date-time":"2011-07-11T13:58:28Z","timestamp":1310392708000},"page":"687-716","source":"Crossref","is-referenced-by-count":6,"title":["Graphs Containing Every 2-Factor"],"prefix":"10.1007","volume":"28","author":[{"given":"Alexandr V.","family":"Kostochka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gexin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,12]]},"reference":[{"issue":"2","key":"1066_CR1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1112\/jlms\/s2-48.1.39","volume":"28","author":"M. Aigner","year":"1993","unstructured":"Aigner M., Brandt S.: Embedding arbitrary graphs of maximum degree two. J. Lond. Math. Soc. 28(2), 39\u201351 (1993)","journal-title":"J. Lond. Math. Soc."},{"key":"1066_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0012-365X(95)00242-O","volume":"152","author":"N. Alon","year":"1996","unstructured":"Alon N., Fischer E. : 2-factors in dense graphs. Discrete Math. 152, 13\u201323 (1996)","journal-title":"Discrete Math."},{"key":"1066_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0095-8956(78)90030-8","volume":"25","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s B., Eldridge S.E.: Packing of graphs and applications to computational complexity. J. Combin. Theory Ser. B. 25, 105\u2013124 (1978)","journal-title":"J. Combin. Theory Ser. B."},{"key":"1066_CR4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(74)90119-8","volume":"10","author":"P.A. Catlin","year":"1974","unstructured":"Catlin P.A.: Subgraphs of graphs. I. Discrete Math. 10, 225\u2013233 (1974)","journal-title":"Discrete Math."},{"key":"1066_CR5","unstructured":"Catlin, P.A.: Embedding subgraphs and coloring graphs under extremal degree conditions. PhD thesis, Ohio State University, Columbus (1976)"},{"key":"1066_CR6","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K. Corr\u00e1di","year":"1963","unstructured":"Corr\u00e1di K., Hajnal A.: On the maximum number of independent circuits in a graph. Acta Math. Acad. Sci. Hung. 14, 423\u2013439 (1963)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"1066_CR7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00493-003-0013-4","volume":"23","author":"B. Csaba","year":"2003","unstructured":"Csaba B., Shokoufandeh A., Szemer\u00e9di E.: Proof of a conjecture of Bollob\u00e1s and Eldridge for graphs of maximum degree three. Combinatorica 23, 35\u201372 (2003)","journal-title":"Combinatorica"},{"key":"1066_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G. Dirac","year":"1952","unstructured":"Dirac G.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1066_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s004930050034","volume":"18","author":"H. Enomoto","year":"1998","unstructured":"Enomoto H.: On the existence of disjoint cycles in a graph. Combinatorica 18, 487\u2013492 (1998)","journal-title":"Combinatorica"},{"key":"1066_CR10","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, 167\u2013182 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1066_CR11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0167-5060(08)70467-9","volume":"41","author":"P. Justesen","year":"1989","unstructured":"Justesen P.: On independent circuits in finite graphs and a conjecture of Erd\u00f3s and Posa. Ann. Discrete Math. 41, 299\u2013306 (1989)","journal-title":"Ann. Discrete Math."},{"issue":"2","key":"1066_CR12","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.jctb.2008.06.007","volume":"99","author":"H.A. Kierstead","year":"2009","unstructured":"Kierstead H.A., Kostochka A.V.: Ore-type versions of Brooks\u2019 theorem. J. Combin. Theory Ser. B 99(2), 298\u2013305 (2009)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"1066_CR13","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. Combin. Probab. Comput. 16(1), 167\u2013169 (2007)","journal-title":"Combin. Probab. Comput."},{"issue":"4","key":"1066_CR14","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s00373-007-0732-1","volume":"23","author":"A.V. Kostochka","year":"2007","unstructured":"Kostochka A.V., Yu G.: An Ore-type analogue of the Sauer\u2013Spencer theorem. Graphs Combin. 23(4), 419\u2013424 (2007)","journal-title":"Graphs Combin."},{"issue":"14","key":"1066_CR15","doi-asserted-by":"crossref","first-page":"4762","DOI":"10.1016\/j.disc.2008.06.001","volume":"309","author":"A.V. Kostochka","year":"2009","unstructured":"Kostochka, A.V., Yu, G.: Ore-type degree conditions for the existence of 2-factors with short cycles. Discrete Math. 309(14), 4762\u20134771 (2009)","journal-title":"Discrete Math."},{"key":"1066_CR16","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":"1066_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","volume":"25","author":"N. Sauer","year":"1978","unstructured":"Sauer N., Spencer J.: Edge disjoint placement of graphs. J. Combin. Theory Ser. B 25, 295\u2013302 (1978)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1066_CR18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0012-365X(99)00009-6","volume":"205","author":"H. Wang","year":"1999","unstructured":"Wang H.: On the maximum number of independent cycles in a graph. Discrete Math. 205, 183\u2013190 (1999)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1066-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1066-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1066-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:33Z","timestamp":1559055513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1066-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,12]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["1066"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1066-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,12]]}}}