{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T11:50:05Z","timestamp":1691668205461},"reference-count":4,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":5525,"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":[[1998,6]]},"DOI":"10.1016\/s0012-365x(98)00083-1","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"297-298","source":"Crossref","is-referenced-by-count":3,"title":["On the small graphs with chromatic number 5 without 4-cliques"],"prefix":"10.1016","volume":"188","author":[{"given":"Nedyalko D.","family":"Nenov","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00083-1_BIB1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0012-365X(93)90309-H","article-title":"The size of a minimum five-chromatic K4-free graph","volume":"122","author":"Hanson","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00083-1_BIB2","first-page":"161","article-title":"On the Zykovs numbers and some its application in Ramsey theory","volume":"9","author":"Nenov","year":"1983","journal-title":"SERDICA Bulgaricae mathematicae publicationes"},{"key":"10.1016\/S0012-365X(98)00083-1_BIB3","first-page":"301","article-title":"The chromatic number of any 10-vertex graph without 4-cliques is at most 4","volume":"37","author":"Nenov","year":"1984","journal-title":"C.R. Acad. Bulgare Sci."},{"key":"10.1016\/S0012-365X(98)00083-1_BIB4","series-title":"Graph colouring problems","author":"Toft","year":"1987"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000831?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000831?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T05:20:43Z","timestamp":1556169643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98000831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":4,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0012365X98000831"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00083-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}