{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:31:08Z","timestamp":1777444268904,"version":"3.51.4"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"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":6499,"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,10]]},"DOI":"10.1016\/0012-365x(94)00063-o","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"151-170","source":"Crossref","is-referenced-by-count":23,"title":["Triangle-free four-chromatic graphs"],"prefix":"10.1016","volume":"145","author":[{"given":"Guoping","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00063-O_BIB1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90133-2","article-title":"On the connection between chromatic number, maximal clique and minimal degree of graph","volume":"8","author":"Andr\u00e1sfai","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00063-O_BIB2","first-page":"xx + 488","article-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0012-365X(94)00063-O_BIB3","first-page":"x + 177","article-title":"Graph theory\u2014an introductory course","volume":"Vol. 63","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/0012-365X(94)00063-O_BIB4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0012-365X(73)90126-X","article-title":"On a valence problem in extremal graph theory","volume":"5","author":"Erd\u00f6s","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00063-O_BIB5","series-title":"Graph Theory","first-page":"89","article-title":"Odd cycles of specified length in non-bipartite graphs","volume":"13","author":"H\u00e4ggkvist","year":"1982"},{"key":"10.1016\/0012-365X(94)00063-O_BIB6","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400063O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400063O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T19:28:47Z","timestamp":1555788527000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400063O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["0012365X9400063O"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00063-o","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}