{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T09:39:11Z","timestamp":1696585151313},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0095-8956(02)00039-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T17:16:12Z","timestamp":1051118172000},"page":"107-118","source":"Crossref","is-referenced-by-count":7,"title":["Packing closed trails into dense graphs"],"prefix":"10.1016","volume":"88","author":[{"given":"P.N","family":"Balister","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(02)00039-4_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0012-365X(81)80029-5","article-title":"Research Problem 3","volume":"36","author":"Alspach","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(02)00039-4_BIB2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1017\/S0963548301004771","article-title":"Packing circuits into Kn","volume":"10","author":"Balister","year":"2001","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0095-8956(02)00039-4_BIB3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1017\/S0963548301004539","article-title":"On the Alspach conjecture","volume":"10","author":"Balister","year":"2001","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0095-8956(02)00039-4_BIB4","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/S0095-8956(02)00039-4_BIB5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0012-365X(01)00051-6","article-title":"List Decomposition of Graphs","volume":"243","author":"Caro","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(02)00039-4_BIB6","unstructured":"T. Gustavsson, Decompositions of large graphs and digraphs with high minimum degree, Doctoral Dissertation, Dept. of Mathematics, Univ. of Stockholm, 1991."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000394?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000394?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T15:25:24Z","timestamp":1553527524000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895602000394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0095895602000394"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(02)00039-4","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}