{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T12:56:26Z","timestamp":1768740986119,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"S2","license":[{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00493-022-4932-3","type":"journal-article","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T11:55:12Z","timestamp":1665402912000},"page":"1347-1356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt"],"prefix":"10.1007","volume":"42","author":[{"given":"Hemanshu","family":"Kaul","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Reiniger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,10]]},"reference":[{"key":"4932_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1112\/jlms\/s2-48.1.39","volume":"48","author":"M Aigner","year":"1993","unstructured":"M. Aigner and S. Brandt: Embedding arbitrary graphs of maximum degree two, J. London Math. Soc. (2) 48 (1993), 39\u201351.","journal-title":"J. London Math. Soc. (2)"},{"key":"4932_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0012-365X(95)00242-O","volume":"152","author":"N Alon","year":"1996","unstructured":"N. Alon and E. Fischer: 2-factors in dense graphs, Discrete Math. 152 (1996), 13\u201323.","journal-title":"Discrete Math."},{"key":"4932_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0095-8956(78)90030-8","volume":"25","author":"B Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s and S. E. Eldridge: Packings of graphs and applications to computational complexity, J. Combin. Theory Ser. B 25 (1978), 105\u2013124.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4932_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jctb.2007.05.002","volume":"98","author":"B Bollob\u00e1s","year":"2008","unstructured":"B. Bollob\u00e1s, A. Kostochka and K. Nakprasit: Packing d-degenerate graphs, J. Combin. Theory Ser. B 98 (2008), 85\u201394.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4932_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/jctb.1994.1030","volume":"61","author":"S Brandt","year":"1994","unstructured":"S. Brandt: Subtrees and subforests of graphs, J. Combin. Theory Ser. B 61 (1994), 63\u201370.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4932_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0012-365X(74)90119-8","volume":"10","author":"P A Catlin","year":"1974","unstructured":"P. A. Catlin: Subgraphs of graphs. I, Discrete Math. 10 (1974), 225\u2013233.","journal-title":"Discrete Math."},{"key":"4932_CR7","series-title":"Thesis (Ph.D.)\u2014The Ohio State University","volume-title":"Embedding subgraphs and coloring graphs under extremal degree conditions","author":"P A Catlin","year":"1976","unstructured":"P. A. Catlin: Embedding subgraphs and coloring graphs under extremal degree conditions, ProQuest LLC, Ann Arbor, MI, 1976. Thesis (Ph.D.)\u2014The Ohio State University."},{"key":"4932_CR8","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1017\/S0963548307008395","volume":"16","author":"B Csaba","year":"2007","unstructured":"B. Csaba: On the Bollobs-Eldridge conjecture for bipartite graphs, Combinatorics, Probability and Computing 16 (2007), 661\u2013691.","journal-title":"Combinatorics, Probability and Computing"},{"key":"4932_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00493-003-0013-4","volume":"23","author":"B Csaba","year":"2003","unstructured":"B. Csaba, A. Shokoufandeh and E. Szemer\u00e9di: Proof of a conjecture of Bollob\u00e1s and Eldridge for graphs of maximum degree three, Combinatorica 23 (2003), 35\u201372. Paul Erd\u0151s and his mathematics (Budapest, 1999).","journal-title":"Combinatorica"},{"key":"4932_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"s3\u20132","author":"G A Dirac","year":"1952","unstructured":"G. A. Dirac: Some theorems on abstract graphs, Proceedings of the London Mathematical Society s3\u20132 (1952), 69\u201381.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"4932_CR11","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1006\/jctb.2000.1971","volume":"80","author":"N Eaton","year":"2000","unstructured":"N. Eaton: A near packing of two graphs, J. Combin. Theory Ser. B 80 (2000), 98\u2013103.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4932_CR12","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1017\/S0963548306007929","volume":"16","author":"H Kaul","year":"2007","unstructured":"H. Kaul and A. Kostochka: Extremal graphs for a graph packing theorem of Sauer and Spencer, Combin. Probab. Comput. 16 (2007), 409\u2013416.","journal-title":"Combin. Probab. Comput."},{"key":"4932_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00493-008-2278-0","volume":"28","author":"H Kaul","year":"2008","unstructured":"H. Kaul, A. Kostochka and G. Yu: On a graph packing conjecture by Bollob\u00e1s, Eldridge and Catlin, Combinatorica 28 (2008), 469\u2013485.","journal-title":"Combinatorica"},{"key":"4932_CR14","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1017\/S0963548309009973","volume":"18","author":"H A Kierstead","year":"2009","unstructured":"H. A. Kierstead and A. V. Kostochka: Efficient graph packing via game colouring, Combin. Probab. Comput. 18 (2009), 765\u2013774.","journal-title":"Combin. Probab. Comput."},{"key":"4932_CR15","first-page":"113","volume-title":"Surveys in combinatorics 2009, volume 365 of London Math. Soc. Lecture Note Ser.","author":"H A Kierstead","year":"2009","unstructured":"H. A. Kierstead, A. V. Kostochka and G. Yu: Extremal graph packing problems: Ore-type versus Dirac-type, in: Surveys in combinatorics 2009, volume 365 of London Math. Soc. Lecture Note Ser., 113\u2013135. Cambridge Univ. Press, Cambridge, 2009."},{"key":"4932_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","volume":"25","author":"N Sauer","year":"1978","unstructured":"N. Sauer and J. Spencer: Edge disjoint placement of graphs, J. Combin. Theory Ser. B 25 (1978), 295\u2013302.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4932_CR17","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1017\/S0963548318000032","volume":"27","author":"W C van Batenburg","year":"2018","unstructured":"W. C. van Batenburg and R. J. Kang: Packing graphs of bounded codegree, Combin. Probab. Comput. 27 (2018), 725\u2013740.","journal-title":"Combin. Probab. Comput."},{"key":"4932_CR18","first-page":"78","volume":"362","author":"M Wo\u017aniak","year":"1997","unstructured":"M. Wo\u017aniak: Packing of graphs, Dissertationes Math. (Rozprawy Mat.) 362 (1997), 78.","journal-title":"Dissertationes Math. (Rozprawy Mat.)"},{"key":"4932_CR19","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0167-5060(08)70809-4","volume":"72","author":"H P Yap","year":"1988","unstructured":"H. P. Yap: Packing of graphs\u2014a survey, in: Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, 1986), volume 72, 395\u2013404, 1988.","journal-title":"Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, 1986)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-022-4932-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-022-4932-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-022-4932-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T16:35:22Z","timestamp":1675355722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-022-4932-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,10]]},"references-count":19,"journal-issue":{"issue":"S2","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["4932"],"URL":"https:\/\/doi.org\/10.1007\/s00493-022-4932-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,10]]},"assertion":[{"value":"9 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}