{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:31:15Z","timestamp":1648683075724},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T00:00:00Z","timestamp":1185926400000},"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":[[2007,8]]},"DOI":"10.1007\/s00373-007-0732-1","type":"journal-article","created":{"date-parts":[[2007,7,27]],"date-time":"2007-07-27T13:03:06Z","timestamp":1185541386000},"page":"419-424","source":"Crossref","is-referenced-by-count":4,"title":["An Ore-type analogue of the Sauer-Spencer Theorem"],"prefix":"10.1007","volume":"23","author":[{"given":"Alexandr","family":"Kostochka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gexin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"732_CR1","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory, Academic Press, London, 1978","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"732_CR2","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Eldridge, S.E.: Packing of graphs and applications to computational complexity, J. Comb. Theory Ser, B, 25, 105\u2013124 (1978)","DOI":"10.1016\/0095-8956(78)90030-8"},{"key":"732_CR3","doi-asserted-by":"crossref","unstructured":"Catlin, P.A.: Subgraphs of graphs. I. Discrete Math. 10, 225\u2013233 (1974)","DOI":"10.1016\/0012-365X(74)90119-8"},{"key":"732_CR4","unstructured":"Dirac, G.: Some theorems on abstract graphs, Proc. London Math. Soc., 2, 69\u201381 (1952)"},{"key":"732_CR5","unstructured":"Enomoto, H.: On the existence of disjoint cycles in a graph, Combinatorica 18, 487\u2013492 (1998)"},{"key":"732_CR6","unstructured":"Kaul, H., Kostochka, A.: Extremal graphs for a graph packing theorem of Sauer and Spencer, to appear in Combinatorics, Probability and Computing"},{"key":"732_CR7","unstructured":"Kaul, H., Kostochka, A., Yu, G.: On a graph packing conjecture by Bollob\u00e1s, Eldridge and Catlin, submitted"},{"key":"732_CR8","unstructured":"Li, H., Wo\u017aniak, M.: A note on graphs containing all trees of a given size, Preprint MD 007 (2005), www.ii.nj.edu.pl\/preMD\/"},{"key":"732_CR9","doi-asserted-by":"crossref","unstructured":"Ore, O.: Note on Hamilton circuits, Am. Math. Monthly, 67, 55 (1960)","DOI":"10.2307\/2308928"},{"key":"732_CR10","unstructured":"Sauer, N., Spencer, J.: Edge disjoint placement of graphs, J. Combin. Theory Ser. B, 25, 295\u2013302 (1978)"},{"key":"732_CR11","unstructured":"Wang, H.: On the maximum number of independent cycles in a graph, Discrete Math. 205, 183\u2013190 (1999)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0732-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0732-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0732-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:27Z","timestamp":1559055507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0732-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,8]]}},"alternative-id":["732"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0732-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8]]}}}