{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:12:19Z","timestamp":1648980739678},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":7198,"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":[[1993,11]]},"DOI":"10.1016\/0012-365x(93)90309-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"353-355","source":"Crossref","is-referenced-by-count":1,"title":["The size of a minimum five-chromatic K4-free graph"],"prefix":"10.1016","volume":"122","author":[{"given":"Denis","family":"Hanson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary","family":"MacGillivray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dale","family":"Youngs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90309-H_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(93)90309-H_BIB2","unstructured":"T. Jensen and G. Royle, Small graphs with chromatic number five: a computer search, preprint."},{"key":"10.1016\/0012-365X(93)90309-H_BIB3","unstructured":"N.D. Nenov, The chromatic number of any 10-vertex graph without 4-cliques is at most 4 (in Russian), C.R. Acad. Bulgare Sci. 37; 301\u2013304."},{"key":"10.1016\/0012-365X(93)90309-H_BIB4","series-title":"Graph colouring problems, part 1","author":"Toft","year":"1987"},{"key":"10.1016\/0012-365X(93)90309-H_BIB5","series-title":"Graph Colouring","first-page":"9","article-title":"75 unsolved graph-colouring problems","volume":"218","author":"Toft","year":"1990"},{"key":"10.1016\/0012-365X(93)90309-H_BIB6","series-title":"Racal Research","article-title":"The smallest K4-free 5-chromatic graph","author":"Youngs","year":"1990"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390309H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390309H?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:56:45Z","timestamp":1555135005000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390309H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["0012365X9390309H"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90309-h","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}