{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T09:23:53Z","timestamp":1750497833050},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1007\/bf01285818","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T17:26:39Z","timestamp":1111685199000},"page":"295-301","source":"Crossref","is-referenced-by-count":8,"title":["On packing bipartite graphs"],"prefix":"10.1007","volume":"12","author":[{"given":"P\ufffdter","family":"Hajnal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\ufffdri\ufffd","family":"Szegedy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"19","author":"D. Angluin","year":"1979","unstructured":"D. Angluin, andL. G. Valiant: Fast probabilistic algorithms for Hamiltonian circuits and matchings.Journal of Computer and System Sciences 19 (1979), 155?193.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR2","volume-title":"Extremal Graph theory","author":"B. Bollob\ufffds","year":"1978","unstructured":"B. Bollob\ufffds:Extremal Graph theory, Academic Press, London, 1978."},{"key":"CR3","volume-title":"Random Graphs","author":"B. Bollob\ufffds","year":"1985","unstructured":"B. Bollob\ufffds:Random Graphs, Academic Press, London, 1985."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0095-8956(78)90030-8","volume":"25","author":"B. Bollob\ufffds","year":"1978","unstructured":"B. Bollob\ufffds, andS. E. Eldridge: Packing of graphs and applications to computational complexity,J. of Combinatorial Theory Ser. B 25 (1978), 105?124.","journal-title":"J. of Combinatorial Theory Ser. B"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/jgt.3190010308","volume":"1","author":"D. Burns","year":"1977","unstructured":"D. Burns, andS. Schuster: Every (p, p-1) graph is contained in its complement.J. Graph Theory 1 (1977), 277?279.","journal-title":"J. Graph Theory"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF02761996","volume":"30","author":"D. Burns","year":"1978","unstructured":"D. Burns, andS. Schuster: Embedding (p, p-1) graphs in their complements,Israel J. Math. 30 (1978), 313?320.","journal-title":"Israel J. Math."},{"key":"CR7","doi-asserted-by":"crossref","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?233.","journal-title":"Discrete Math."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"H. Chernoff: A measure of asymptotic effiency for tests of a hypothesis based on the sum of observations,Annals of Math. Stat. 23 (1952), 493?509.","journal-title":"Annals of Math. Stat."},{"key":"CR9","volume-title":"Probabilistic methods in combinatorics","author":"P. Erd?s","year":"1974","unstructured":"P. Erd?s, andJ. Spencer:Probabilistic methods in combinatorics, Akad\ufffdmiai Kiad\ufffd, Budapest, 1974."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.21136\/CMJ.1981.101722","volume":"31","author":"R. J. Faudree","year":"1981","unstructured":"R. J. Faudree, C. C. Rousseau, R. H. Schelp, andS. Schuster: Embedding graphs in their complements,Czechoslovak Math J. 31 (1981), 53?62.","journal-title":"Czechoslovak Math J."},{"key":"CR11","first-page":"463","volume-title":"Combinatorics","author":"A. Gy\ufffdrf\ufffds","year":"1976","unstructured":"A. Gy\ufffdrf\ufffds, andJ. Lehel: Packing trees of different order intoK n , in:Combinatorics, Akad\ufffdmiai kiad\ufffd, Budapest 1976, 463?469"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01206357","volume":"11","author":"P. Hajnal","year":"1991","unstructured":"P. Hajnal: An ?(n 4\/3) lower bound on the randomized decision tree complexity of graph properties,Combinatorica 11 (1991), 131?143.","journal-title":"Combinatorica"},{"key":"CR13","first-page":"149","volume":"11","author":"S. M. Hedetniemi","year":"1981","unstructured":"S. M. Hedetniemi, S. T. Hedetniemi, andP. J. Slater: A note on packing two trees intoK n ,Ars Combinatoria 11 (1981), 149?153.","journal-title":"Ars Combinatoria"},{"key":"CR14","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\ufffdsz","year":"1979","unstructured":"L. Lov\ufffdsz:Combinatorial Problems and Exercises, North Holland, Amsterdam, 1979."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","volume":"25","author":"N. Sauer","year":"1978","unstructured":"N. Sauer, andJ. Spencer: Edge-disjoint placement of graphs,J. of Combinatorial Theory Ser. B 25 (1978), 295?302.","journal-title":"J. of Combinatorial Theory Ser. B"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1002\/jgt.3190090203","volume":"9","author":"P. J. Slater","year":"1985","unstructured":"P. J. Slater, S. K. Teo, andH. P. Yap: Packing a tree with a graph of the same size.J. Graph Theory 9 (1985), 213?216.","journal-title":"J. Graph Theory"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0195-6698(87)80011-2","volume":"8","author":"S. K. Teo","year":"1987","unstructured":"S. K. Teo, andH. P. Yap: Two theorems on packing of graphs,Europ. J. Combinatorics 8 (1987), 199?207.","journal-title":"Europ. J. Combinatorics"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01285818.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01285818\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01285818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T08:10:45Z","timestamp":1625645445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01285818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["BF01285818"],"URL":"https:\/\/doi.org\/10.1007\/bf01285818","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}