{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T22:38:36Z","timestamp":1768689516165,"version":"3.49.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":[[1990,6]]},"DOI":"10.1007\/bf01787731","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T18:50:02Z","timestamp":1119207002000},"page":"197-205","source":"Crossref","is-referenced-by-count":6,"title":["Packing two graphs of ordern having total size at most 2n \u2212 2"],"prefix":"10.1007","volume":"6","author":[{"given":"S. K.","family":"Teo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. P.","family":"Yap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01787731_CR1","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. Comb. Theory (B)25, 105\u2013124 (1978)","journal-title":"J. Comb. Theory (B)"},{"key":"BF01787731_CR2","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. London \u2014 New York: Academic Press 1978"},{"key":"BF01787731_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/jgt.3190010308","volume":"1","author":"D. Burns","year":"1977","unstructured":"Burns, D., Schuster, S.: Every (p,p \u2212 2) graph is contained in its complement. J. Graph Theory1, 277\u2013279 (1977)","journal-title":"J. Graph Theory"},{"key":"BF01787731_CR4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF02761996","volume":"30","author":"D. Burns","year":"1978","unstructured":"Burns, D., Schuster, S.: Embedding (p,p \u2212 1) graphs in their complements. Israel J. Math.30, 313\u2013320 (1978)","journal-title":"Israel J. Math."},{"key":"BF01787731_CR5","first-page":"106","volume":"31","author":"R.J. Faudree","year":"1978","unstructured":"Faudree, R.J., Rousseau, C.C., Schelp, R.H., Schuster, S.: Embedding graphs in their complements. Csechoslovak Math. J.31: 106, 53\u201362 (1978)","journal-title":"Csechoslovak Math. J."},{"key":"BF01787731_CR6","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. Comb. Theory (B)25, 295\u2013302 (1978)","journal-title":"J. Comb. Theory (B)"},{"key":"BF01787731_CR7","first-page":"697","volume-title":"Graph Theory with Applications to Algorithms and Computer Science","author":"S. Schuster","year":"1985","unstructured":"Schuster, S.: Packing a tree of orderp with a (p,p) graph. In: Graph Theory with Applications to Algorithms and Computer Science (Y. Alvai et al. eds.) pp. 697\u2013712. New York: John Wiley and Sons 1985"},{"key":"BF01787731_CR8","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1002\/jgt.3190090203","volume":"9","author":"P.J. Slater","year":"1985","unstructured":"Slater, P.J., Teo, S.K., Yap, H.P.: Packing a tree with a graph of the same size. J. Graph Theory9, 213\u2013216 (1985)","journal-title":"J. Graph Theory"},{"key":"BF01787731_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0195-6698(87)80011-2","volume":"8","author":"S.K. Teo","year":"1987","unstructured":"Teo, S.K., Yap, H.P.: Two theorems on packings of graphs. European J. Comb.8, 199\u2013207 (1987)","journal-title":"European J. Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787731.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01787731\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T13:12:20Z","timestamp":1557493940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01787731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["BF01787731"],"URL":"https:\/\/doi.org\/10.1007\/bf01787731","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}