{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T15:03:26Z","timestamp":1768489406766,"version":"3.49.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,10,17]],"date-time":"2016-10-17T00:00:00Z","timestamp":1476662400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s00493-016-3356-3","type":"journal-article","created":{"date-parts":[[2016,10,18]],"date-time":"2016-10-18T10:16:22Z","timestamp":1476785782000},"page":"863-886","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Density of 5\/2-critical graphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Zden\u011bk","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[]},{"given":"Luke","family":"Postle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,17]]},"reference":[{"key":"3356_CR1","first-page":"417","volume":"5","author":"O. Borodin","year":"2008","unstructured":"O. Borodin, S. G. Hartke, A. O. Ivanova, A. V. Kostochka and D. B. West: Circular (5,2)-coloring of sparse graphs, Sib. Elektron. Mat. Izv. 5 (2008), 417\u2013426.","journal-title":"Sib. Elektron. Mat. Izv."},{"key":"3356_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0095-8956(03)00081-9","volume":"90","author":"O. Borodin","year":"2004","unstructured":"O. Borodin, S.-J. Kim, A. Kostochka and D. West: Homomorphisms from sparse graphs with large girth, Journal of Combinatorial Theory, Series B 90 (2004), 147\u2013159.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3356_CR3","unstructured":"M. DeVos: Open problem garden: Mapping planar graphs to odd cycles http:\/\/www.openproblemgarden.org\/op\/mapping_planar_graphs_to_odd_cycles."},{"key":"3356_CR4","first-page":"109","volume":"8","author":"H. Gr\u00f6tzsch","year":"1959","unstructured":"H. Gr\u00f6tzsch: Ein Dreifarbensatz f\u00fcr Dreikreisfreie Netze auf der Kugel, Math.Natur. Reihe 8 (1959), 109\u2013120.","journal-title":"Math.Natur. Reihe"},{"key":"3356_CR5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/B978-0-444-86893-0.50031-0","volume":"37","author":"F. Jaeger","year":"1984","unstructured":"F. Jaeger: On circular ows in graphs, in: Finite and Infinite Sets (Eger, 1981), Colloq. Math. Soc. J. Bolyai, vol. 37, 1984, 391\u2013402.","journal-title":"Finite and Infinite Sets (Eger, 1981), Colloq. Math. Soc. J. Bolyai"},{"key":"3356_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/(SICI)1097-0118(200002)33:2<109::AID-JGT5>3.0.CO;2-F","volume":"33","author":"W. Klostermeyer","year":"2000","unstructured":"W. Klostermeyer and C. Q. Zhang: (2+\u03b5)-coloring of planar graphs with large odd-girth, J. Graph Theory 33 (2000), 109\u2013119.","journal-title":"J. Graph Theory"},{"key":"3356_CR7","volume-title":"Ore\u2019s conjecture for k=4 and Gr\u00f6tzsch Theorem","author":"A. Kostochka","year":"2012","unstructured":"A. Kostochka and M. Yancey: Ore\u2019s conjecture for k=4 and Gr\u00f6tzsch Theorem, Manuscript, 2012."},{"key":"3356_CR8","volume-title":"The Four Color Problem","author":"O. Ore","year":"1967","unstructured":"O. Ore: The Four Color Problem, Academic Press, New York, 1967."},{"key":"3356_CR9","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1002\/jgt.3190120411","volume":"12","author":"A. Vince","year":"1988","unstructured":"A. Vince: Star chromatic number, Journal of Graph Theory 12 (1988), 551\u2013559.","journal-title":"Journal of Graph Theory"},{"key":"3356_CR10","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0012-365X(00)00217-X","volume":"229","author":"X. Zhu","year":"2001","unstructured":"X. Zhu: Circular chromatic number: a survey, Discrete Mathematics 229 (2001), 371\u2013410.","journal-title":"Discrete Mathematics"},{"key":"3356_CR11","doi-asserted-by":"crossref","first-page":"R25","DOI":"10.37236\/1569","volume":"8","author":"X. Zhu","year":"2001","unstructured":"X. Zhu: Circular chromatic number of planar graphs of large odd girth, Electronic J. of Combinatorics 8 (2001), R25.","journal-title":"Electronic J. of Combinatorics"},{"key":"3356_CR12","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/3-540-33700-8_25","volume-title":"Topics in discrete mathematics","author":"X. Zhu","year":"2006","unstructured":"X. Zhu: Recent developments in circular colouring of graphs, in: Topics in discrete mathematics, Springer, 2006, 497\u2013550."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3356-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3356-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3356-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T18:48:58Z","timestamp":1601146138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3356-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,17]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["3356"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3356-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,17]]}}}