{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:59:41Z","timestamp":1720054781062},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0012-365x(99)90031-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"3-13","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Square critically 3-chromatic hypergraphs"],"prefix":"10.1016","volume":"197-198","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"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90031-6_BIB1","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(99)90031-6_BIB2","first-page":"311","article-title":"Cycles of length 0 modulo k in directed graphs","volume":"62","author":"Alon","year":"1988","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(99)90031-6_BIB3","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(99)90031-6_BIB4","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BF01504345","article-title":"\u00dcber die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzahligen Koeffizienten","volume":"17","author":"Fekete","year":"1923","journal-title":"Math. Zeit."},{"key":"10.1016\/S0012-365X(99)90031-6_BIB5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0012-365X(96)00183-5","article-title":"Blocking set free configurations and their relations to digraphs and hypergraphs","volume":"165\/166","author":"Gropp","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90031-6_BIB6","article-title":"Aspects of the even cycle problem","author":"Kornerup","year":"1992"},{"key":"10.1016\/S0012-365X(99)90031-6_BIB7","article-title":"Some Results on hypergraphs","author":"Liu","year":"1976"},{"key":"10.1016\/S0012-365X(99)90031-6_BIB8","first-page":"3","article-title":"Coverings and colorings of hypergraphs","volume":"8","author":"Lov\u00e1sz","year":"1973"},{"key":"10.1016\/S0012-365X(99)90031-6_BIB9","series-title":"Recent Advances in Graph Theory","first-page":"1445","article-title":"Problem 2","author":"Lov\u00e1sz","year":"1975"},{"key":"10.1016\/S0012-365X(99)90031-6_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(99)90031-6_BIB11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0195-6698(85)80025-1","article-title":"Even cycles in directed graphs","volume":"6","author":"Thomassen","year":"1985","journal-title":"European J. Combin."},{"key":"10.1016\/S0012-365X(99)90031-6_BIB12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1090\/S0894-0347-1992-1135027-1","article-title":"The even cycle problem for directed graphs","volume":"5","author":"Thomassen","year":"1992","journal-title":"J. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(99)90031-6_BIB13","series-title":"Combinatories","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:S0012365X99900316?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900316?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:22:26Z","timestamp":1553228546000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99900316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":13,"alternative-id":["S0012365X99900316"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90031-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}