{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:11:31Z","timestamp":1777540291964,"version":"3.51.4"},"reference-count":35,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8994,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0012-365x(88)90232-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"395-404","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":33,"title":["Packing of graphs\u2014a survey"],"prefix":"10.1016","volume":"72","author":[{"given":"H.P.","family":"Yap","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(88)90232-4_BIB1","article-title":"Packing of digraphs","author":"Benhocine","year":"1983","journal-title":"Technische Hogeschool Twente"},{"key":"10.1016\/0012-365X(88)90232-4_BIB2","series-title":"Extremal graph theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0012-365X(88)90232-4_BIB3","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0012-365X(83)90254-6","article-title":"Some remarks on packing trees","volume":"46","author":"Bollob\u00e1s","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(88)90232-4_BIB4","series-title":"Proc. Fifth British Combinatorial Conf.","first-page":"689","article-title":"Problem","author":"Bolob\u00e1s","year":"1976"},{"key":"10.1016\/0012-365X(88)90232-4_BIB5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0095-8956(78)90030-8","article-title":"Packing of graphs and applications to computational complexity","volume":"25","author":"Bollob\u00e1s","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(88)90232-4_BIB6","article-title":"Problem","author":"Bollob\u00e1s","year":"1978","journal-title":"Proc. Colloque Intern. CNRS"},{"key":"10.1016\/0012-365X(88)90232-4_BIB7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/jgt.3190010308","article-title":"Every (p,p\u20132) graph is contained in its complement","volume":"1","author":"Burns","year":"1977","journal-title":"J. Graph Theory"},{"issue":"no. 4","key":"10.1016\/0012-365X(88)90232-4_BIB8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF02761996","article-title":"Embedding (n,n\u20131) graphs in their complements","volume":"vol. 30","author":"Burns","year":"1978","journal-title":"Israel J. Math."},{"key":"10.1016\/0012-365X(88)90232-4_BIB9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(74)90119-8","article-title":"Subgraphs of graphs","volume":"10","author":"Catlin","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(88)90232-4_BIB10","series-title":"Graph Theory and Computing","first-page":"139","article-title":"Embedding subgraphs under extremal degree conditions","author":"Catlin","year":"1977"},{"key":"10.1016\/0012-365X(88)90232-4_BIB11","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u00f6s","year":"1959","journal-title":"Acta. Math. Acad. Sci. Hungar."},{"issue":"106","key":"10.1016\/0012-365X(88)90232-4_BIB12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.21136\/CMJ.1981.101722","article-title":"Embedding graphs in their complements","volume":"31","author":"Faudree","year":"1981","journal-title":"Czechoslovak J. Math."},{"key":"10.1016\/0012-365X(88)90232-4_BIB13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(81)90262-4","article-title":"A note on path-perfect graphs","volume":"33","author":"Fink","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(88)90232-4_BIB14","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/jgt.3190070309","article-title":"Packing graphs with odd and even trees","volume":"7","author":"Fishburn","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(88)90232-4_BIB15","series-title":"Computer and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(88)90232-4_BIB16","first-page":"463","article-title":"Packing trees of different order into Kn","volume":"18","author":"Gy\u00e1rf\u00e1s","year":"1978","journal-title":"Colloq. Math. Soc. J\u00e1nos"},{"key":"10.1016\/0012-365X(88)90232-4_BIB17","first-page":"149","article-title":"A note on packing two trees into Kn","volume":"11","author":"Hedetniemi","year":"1981","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(88)90232-4_BIB18","first-page":"63","article-title":"Packing trees","volume":"33","author":"Hobbs","year":"1981","journal-title":"Graph Theory and Computing"},{"key":"10.1016\/0012-365X(88)90232-4_BIB19","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0097-3165(84)90003-7","article-title":"Packing sequences","volume":"36","author":"Hobbs","year":"1984","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(88)90232-4_BIB20","first-page":"26","article-title":"Decomposition of complete graphs into trees","volume":"5","author":"Huang","year":"1978","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(88)90232-4_BIB21","article-title":"On the computational complexity of graph theoretical properties","author":"Milner","year":"1974","journal-title":"University of Calgary Research Paper No. 232"},{"key":"10.1016\/0012-365X(88)90232-4_BIB22","first-page":"162","article-title":"Problem 25","author":"Ringel","year":"1964","journal-title":"Theory of graphs and its applications"},{"key":"10.1016\/0012-365X(88)90232-4_BIB23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","article-title":"Edge disjoint placement of graphs","volume":"25","author":"Sauer","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(88)90232-4_BIB24","series-title":"Graphs theory with applications to algorithms and computer science","first-page":"697","article-title":"Packing a tree of order p with a (p,p)","author":"Schuster","year":"1985"},{"key":"10.1016\/0012-365X(88)90232-4_BIB25","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1002\/jgt.3190090203","article-title":"Packing a tree with a graph of the same size","volume":"9","author":"Slater","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(88)90232-4_BIB26","first-page":"190","article-title":"Packing trees of different size into the complete graph","volume":"vol. 328","author":"Straight","year":"1979","journal-title":"Topics in graph theory"},{"key":"10.1016\/0012-365X(88)90232-4_BIB27","article-title":"Applications of the uniformity lemma","author":"Szemer\u00e9di","year":"1986","journal-title":"The First Japan Inter. Conf. on Graph Theory and Applications, Hakone"},{"key":"10.1016\/0012-365X(88)90232-4_BIB28","series-title":"M.Sc. Thesis","article-title":"Packing of graphs","author":"Teo","year":"1985"},{"key":"10.1016\/0012-365X(88)90232-4_BIB29","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0195-6698(87)80011-2","article-title":"Two theorems on packing of graphs","volume":"8","author":"Teo","year":"1987","journal-title":"Europ. J. Combinatorics"},{"key":"10.1016\/0012-365X(88)90232-4_BIB30","unstructured":"S.K. Teo and H.P. Yap, Packing two graphs of order n having total size at most 2n\u20132 (submitted)."},{"issue":"no. 2","key":"10.1016\/0012-365X(88)90232-4_BIB31","article-title":"Unsolved problems","volume":"vol. 14","author":"Wojda","year":"1985","journal-title":"Graph Theory Newsletter"},{"key":"10.1016\/0012-365X(88)90232-4_BIB32","first-page":"71","article-title":"Packing and extremal digraphs","volume":"20","author":"Wojda","year":"1985","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(88)90232-4_BIB33","article-title":"Some topics in graph theory","volume":"108","author":"Yap","year":"1986"},{"key":"10.1016\/0012-365X(88)90232-4_BIB34","first-page":"643","article-title":"Decomposition of graphs into trees","author":"Zaks","year":"1977","journal-title":"Graph Theory and Computing"},{"key":"10.1016\/0012-365X(88)90232-4_BIB35","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0252-9602(18)30663-5","article-title":"A note on the Erd\u00f6s-S\u00f3s conjecture","volume":"4","author":"Bing","year":"1984","journal-title":"Acta Math. Sci."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88902324?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88902324?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T13:35:33Z","timestamp":1757079333000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X88902324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":35,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0012365X88902324"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(88)90232-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Packing of graphs\u2014a survey","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0012-365X(88)90232-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}