{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T04:41:22Z","timestamp":1648615282031},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"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,3]]},"DOI":"10.1016\/s0012-365x(97)00137-4","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"3-11","source":"Crossref","is-referenced-by-count":2,"title":["Color-critical graphs and hypergraphs with few edges and no short cycles"],"prefix":"10.1016","volume":"182","author":[{"given":"H.L.","family":"Abbott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.R.","family":"Hare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00137-4_BIB1","doi-asserted-by":"crossref","first-page":"823","DOI":"10.4153\/CMB-1969-107-x","article-title":"On a combinatorial problem of Erdős","volume":"12","author":"Abbott","year":"1969","journal-title":"Can. Math. Bull."},{"key":"10.1016\/S0012-365X(97)00137-4_BIB2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02125892","article-title":"Sparse color-critical hypergraphs","volume":"9","author":"Abbott","year":"1989","journal-title":"Combinatorica"},{"issue":"4","key":"10.1016\/S0012-365X(97)00137-4_BIB3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1002\/jgt.3190180408","article-title":"Sparse color-critical graphs and hypergraphs with no short cycles","volume":"18","author":"Abbott","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00137-4_BIB4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01902363","article-title":"The existence problem for color-critical linear hypergraphs","volume":"32","author":"Abbott","year":"1978","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/S0012-365X(97)00137-4_BIB5","first-page":"349","article-title":"On k-critical graphs with many edges and no short cycles","volume":"28","author":"Abbott","year":"1993","journal-title":"Stud. Sci. Math. Hungar."},{"key":"10.1016\/S0012-365X(97)00137-4_BIB6","first-page":"285","article-title":"Critical hypergraphs with minimal number of edges","volume":"83","author":"Burstein","year":"1976","journal-title":"Bull. Acad. Sci. Georgian SSR"},{"key":"10.1016\/S0012-365X(97)00137-4_BIB7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","article-title":"On chromatic numbers of graphs and set systems","volume":"17","author":"Erdős","year":"1966","journal-title":"Acta. Math. Hung."},{"key":"10.1016\/S0012-365X(97)00137-4_BIB8","first-page":"116","article-title":"\u00dcber eine Konstruktion nicht n-farbbarer Graphen","volume":"A10","author":"Haj\u00f3s","year":"1961"},{"key":"10.1016\/S0012-365X(97)00137-4_BIB9","article-title":"Some results on hypergraphs","author":"Liu","year":"1976"},{"key":"10.1016\/S0012-365X(97)00137-4_BIB10","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1093\/qmath\/25.1.303","article-title":"On the two-coloring of hypergraphs","volume":"25","author":"Seymour","year":"1974","journal-title":"Quart. J. Math. Oxford"},{"key":"10.1016\/S0012-365X(97)00137-4_BIB11","series-title":"Infinite and Finite Sets","first-page":"1445","article-title":"On color-critical hypergraphs","author":"Toft","year":"1975"},{"key":"10.1016\/S0012-365X(97)00137-4_BIB12","first-page":"322","article-title":"Property B and the four-color problem","author":"Woodall","year":"1972"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001374?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001374?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T11:22:50Z","timestamp":1556277770000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97001374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0012365X97001374"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00137-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}