{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:29:47Z","timestamp":1648578587737},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":8447,"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":[[1990,6]]},"DOI":"10.1016\/0012-365x(90)90211-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"331-333","source":"Crossref","is-referenced-by-count":0,"title":["Enumeration of packed graphs"],"prefix":"10.1016","volume":"82","author":[{"given":"Iwao","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90211-Y_BIB1","series-title":"Combinatorial Theory","author":"Aigner","year":"1979"},{"key":"10.1016\/0012-365X(90)90211-Y_BIB2","series-title":"Graphs and Digraphs","author":"Behzad","year":"1979"},{"key":"10.1016\/0012-365X(90)90211-Y_BIB3","doi-asserted-by":"crossref","first-page":"743","DOI":"10.2140\/pjm.1958.8.743","article-title":"On the number of bicolored graphs","volume":"8","year":"1958","journal-title":"Pacific J. Math."},{"key":"10.1016\/0012-365X(90)90211-Y_BIB4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(85)90077-9","article-title":"The maximum number of cliques in dense graphs","volume":"54","author":"Hedman","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90211-Y_BIB5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(87)90139-7","article-title":"Another extremal problem for Turan graphs","volume":"65","author":"Hedman","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90211-Y_BIB6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0012-365X(86)90048-8","article-title":"Clique graphs of packed graphs","volume":"62","author":"Sato","year":"1986","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090211Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090211Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:54:02Z","timestamp":1555134842000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090211Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0012365X9090211Y"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90211-y","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}