{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:03:47Z","timestamp":1648814627941},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":6621,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1016\/0012-365x(93)e0197-c","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"185-194","source":"Crossref","is-referenced-by-count":0,"title":["The size of k-pseudotrees"],"prefix":"10.1016","volume":"141","author":[{"given":"Emanuel","family":"Knill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Ehrenfeucht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Haussler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)E0197-C_BIB1","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0095-8956(74)90083-5","article-title":"Higher dimensional tree structures","volume":"17","author":"Dewdney","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)E0197-C_BIB2","series-title":"Discrete and Combinatorial Mathematics, an Applied Introduction","author":"Grimaldi","year":"1989"},{"key":"10.1016\/0012-365X(93)E0197-C_BIB3","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(93)E0197-C_BIB4","article-title":"Generalized degrees and densities for families of sets","author":"Knill","year":"1991"},{"key":"10.1016\/0012-365X(93)E0197-C_BIB5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0167-5060(08)70715-5","article-title":"Intersection theorems on structures","volume":"6","author":"Simonovits","year":"1980","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(93)E0197-C_BIB6","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0012-365X(88)90231-2","article-title":"Chromatic polynomials of generalized trees","volume":"72","author":"Whitehead","year":"1988","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0197C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0197C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T13:57:08Z","timestamp":1555250228000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93E0197C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0012365X93E0197C"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)e0197-c","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}