{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:24:58Z","timestamp":1773152698326,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"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":[[1996,5]]},"DOI":"10.1016\/0012-365x(95)00349-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"295-298","source":"Crossref","is-referenced-by-count":22,"title":["A triangle-free circle graph with chromatic number 5"],"prefix":"10.1016","volume":"152","author":[{"given":"A.A.","family":"Ageev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00349-2_bib1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(85)90044-5","article-title":"On the chromatic number of multiple interval graphs and overlap graphs","volume":"55","author":"Gy\u00e1rf\u00e1s","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00349-2_bib2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0012-365X(85)90045-7","article-title":"Covering and coloring problems for relatives of intervals","volume":"55","author":"Gy\u00e1rf\u00e1s","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00349-2_bib3","series-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"key":"10.1016\/0012-365X(95)00349-2_bib4","article-title":"On perfect arc and chord intersection graphs","author":"Karapetyan","year":"1984"},{"key":"10.1016\/0012-365X(95)00349-2_bib5","first-page":"204","article-title":"On upper bounds for the chromatic numbers of graphs","volume":"10","author":"Kostochka","year":"1988","journal-title":"Trudy Inst. Mat."},{"key":"10.1016\/0012-365X(95)00349-2_bib6","doi-asserted-by":"crossref","unstructured":"A. Kostochka and J. Kratochvil, Covering and coloring polygon-circle graphs, Discrete Math., to appear.","DOI":"10.1016\/S0012-365X(96)00344-5"},{"key":"10.1016\/0012-365X(95)00349-2_bib7","series-title":"Graphs, Hypergraphs and Applications, Proceedings of the Conference on Graph Theory","volume":"Band 73","year":"1985"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95003492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95003492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:23:46Z","timestamp":1556130226000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X95003492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0012365X95003492"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00349-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}