{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:26:51Z","timestamp":1648981611581},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"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":8325,"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":[[1990,10]]},"DOI":"10.1016\/0095-8956(90)90099-l","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"93-116","source":"Crossref","is-referenced-by-count":5,"title":["Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions"],"prefix":"10.1016","volume":"50","author":[{"given":"Reinhard","family":"Diestel","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(90)90099-L_BIB1","author":"Diestel","year":"1990"},{"key":"10.1016\/0095-8956(90)90099-L_BIB2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0095-8956(90)90118-J","article-title":"Simplicial tree-decompositions of infinite graphs. I","volume":"48","author":"Diestel","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(90)90099-L_BIB3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0095-8956(90)90100-E","article-title":"Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions","volume":"50","author":"Diestel","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(90)90099-L_BIB4","first-page":"409","article-title":"Simplicial minors and decompositions of graphs","volume":"103","author":"Diestel","year":"1988"},{"key":"10.1016\/0095-8956(90)90099-L_BIB5","series-title":"Combinatorica, Conv. Roma 1983","first-page":"159","article-title":"Simplicial decompositions of infinite graphs","volume":"Vol. 28","author":"Dirac","year":"1986"},{"key":"10.1016\/0095-8956(90)90099-L_BIB6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BF01363288","article-title":"Simpliziale Zerf\u00e4llungen beliebiger (endlicher oder unendlicher) Graphen","volume":"156","author":"Halin","year":"1964","journal-title":"Math. Ann."},{"key":"10.1016\/0095-8956(90)90099-L_BIB7","series-title":"Graphentheorie II","author":"Halin","year":"1981"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090099L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090099L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:52:12Z","timestamp":1548759132000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589569090099L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["009589569090099L"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(90)90099-l","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}