{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:07:50Z","timestamp":1648685270717},"reference-count":8,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987]]},"DOI":"10.1016\/0012-365x(87)90012-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:31:50Z","timestamp":1027639910000},"page":"241-244","source":"Crossref","is-referenced-by-count":0,"title":["A non-covering graph of girth six"],"prefix":"10.1016","volume":"63","author":[{"given":"Oliver","family":"Pretzel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(87)90012-4_BIB1","series-title":"Ordered Sets","first-page":"419","article-title":"Problem 5.6","author":"Aigner","year":"1982"},{"key":"10.1016\/0012-365X(87)90012-4_BIB2","series-title":"Complexity of Diagrams","author":"Ne\u0161et\u0159il","year":"1985"},{"key":"10.1016\/0012-365X(87)90012-4_BIB3","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1090\/S0002-9939-1978-0507350-7","article-title":"On a probabilistic graph-theoretical method","volume":"72","author":"Ne\u0161et\u0159il","year":"1978","journal-title":"Proc. AMS"},{"key":"10.1016\/0012-365X(87)90012-4_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0095-8956(79)90084-4","article-title":"A short proof of the existence of highly chromatic graphs without short cycles","volume":"27","author":"Ne\u0161et\u0159l","year":"1979","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(87)90012-4_BIB5","volume":"Vol. XXXVIII","author":"Ore","year":"1962"},{"key":"10.1016\/0012-365X(87)90012-4_BIB6","series-title":"Graphs and Order","first-page":"530","article-title":"Problem 2.3","author":"Pretzel","year":"1985"},{"key":"10.1016\/0012-365X(87)90012-4_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/BF00337921","article-title":"On graphs that can be oriented as diagrams of ordered sets","author":"Pretzel","year":"1985","journal-title":"Order"},{"key":"10.1016\/0012-365X(87)90012-4_BIB8","series-title":"Graphs and Order","first-page":"103","article-title":"The diagram","author":"Rival","year":"1985"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87900124?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87900124?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:27:51Z","timestamp":1555140471000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X87900124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":8,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0012365X87900124"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(87)90012-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}