{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T05:10:53Z","timestamp":1719724253114},"reference-count":9,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":7794,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1985,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove that if <jats:italic>T<\/jats:italic> is a tree of order <jats:italic>p<\/jats:italic> \u2a7e 5 and <jats:italic>G<\/jats:italic> is a graph of order <jats:italic>p<\/jats:italic> and size <jats:italic>p<\/jats:italic> \u2010 1 such that neither <jats:italic>T<\/jats:italic> nor <jats:italic>G<\/jats:italic> is a star, then <jats:italic>T<\/jats:italic> can be embedded in G, the complement of <jats:italic>G<\/jats:italic>.<\/jats:p>","DOI":"10.1002\/jgt.3190090203","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T07:19:04Z","timestamp":1180423144000},"page":"213-216","source":"Crossref","is-referenced-by-count":16,"title":["Packing a tree with a graph of the same size"],"prefix":"10.1002","volume":"9","author":[{"given":"P. J.","family":"Slater","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. K.","family":"Teo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. P.","family":"Yap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(78)90030-8"},{"key":"e_1_2_1_3_2","volume-title":"Extremal Graph Theory","author":"Bollob\u00e1s B.","year":"1978"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010308"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761996"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90119-8"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.21136\/CMJ.1981.101722","article-title":"Embedding graphs in their complements","volume":"31","author":"Faudree R. J.","year":"1981","journal-title":"Czechoslovak Math. J."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_9_2","first-page":"149","article-title":"A note on packing two trees into Kn","volume":"11","author":"Hedetniemi S. M.","year":"1981","journal-title":"Ars Combinatoria"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(78)90005-9"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190090203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190090203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T05:28:38Z","timestamp":1697866118000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190090203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["10.1002\/jgt.3190090203"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190090203","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}