{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:11:53Z","timestamp":1710349913120},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":8233,"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":[[1991,1]]},"DOI":"10.1016\/0012-365x(91)90076-e","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"91-95","source":"Crossref","is-referenced-by-count":3,"title":["On graphic and 3-hypergraphic sequences"],"prefix":"10.1016","volume":"87","author":[{"given":"S.A.","family":"Choudum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90076-E_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(91)90076-E_BIB2","first-page":"9","article-title":"Lattices and degree sequences of uniform hypergraphs","volume":"21-A","author":"Billington","year":"1986","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(91)90076-E_BIB3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0012-365X(74)80016-6","article-title":"Conditions for sequences to be r-graphic","volume":"7","author":"Chungphaisan","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(91)90076-E_BIB4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0166-218X(86)90028-4","article-title":"Some NP-complete problems for hypergraph degree sequences","volume":"14","author":"Colbourn","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(91)90076-E_BIB5","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1090\/S0002-9939-1975-0384610-1","article-title":"Degree sequences in complexes and hypergraphs","volume":"53","author":"Dewdney","year":"1975","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(91)90076-E_BIB6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF02579228","article-title":"Personal reminiscences and remarks on the mathematical work of Tibor Gallai","volume":"2","author":"Erdős","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(91)90076-E_BIB7","series-title":"Combinatorial Mathematics","author":"Ryser","year":"1963"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190076E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190076E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:56:22Z","timestamp":1555120582000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190076E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0012365X9190076E"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90076-e","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}