{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T15:00:50Z","timestamp":1776870050211,"version":"3.51.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00373-020-02147-y","type":"journal-article","created":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T10:02:28Z","timestamp":1581760948000},"page":"703-718","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The Minimum Number of Edges in 4-Critical Digraphs of Given Order"],"prefix":"10.1007","volume":"36","author":[{"given":"Alexandr V.","family":"Kostochka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2436-9836","authenticated-orcid":false,"given":"Michael","family":"Stiebitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,15]]},"reference":[{"key":"2147_CR1","unstructured":"Bang-Jensen, J., Bellitto, T., Schweser, T., Stiebitz, M.: A Haj\u00f3s-like theorem for digraphs. submitted to Electronic J. Combin. arXiv:1908.04096v1 [math.CO] (2019)"},{"key":"2147_CR2","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/jgt.20003","volume":"46","author":"D Bokal","year":"2004","unstructured":"Bokal, D., Fijav\u017e, G., Juvan, M., Kayll, P.M., Mohar, B.: The circular chromatic number of a digraph. J. Gr. Theory 46, 227\u2013240 (2004)","journal-title":"J. Gr. Theory"},{"key":"2147_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Proc. Camb. Philos. Soc. Math. Phys. Sci. 37, 194\u2013197 (1941)","journal-title":"Proc. Camb. Philos. Soc. Math. Phys. Sci."},{"key":"2147_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1112\/jlms\/s1-27.1.85","volume":"27","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: A property of 4-chromatic graphs and some remarks on critical graphs. J. Lond. Math. Soc. 27, 85\u201392 (1952)","journal-title":"J. Lond. Math. Soc."},{"key":"2147_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.4064\/fm-40-1-42-55","volume":"40","author":"GA Dirac","year":"1953","unstructured":"Dirac, G.A.: The structure of $$k$$-chromatic graphs. Fund. Math. 40, 42\u201355 (1953)","journal-title":"Fund. Math."},{"key":"2147_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1112\/plms\/s3-7.1.161","volume":"7","author":"GA Dirac","year":"1957","unstructured":"Dirac, G.A.: A theorem of R. L. Brooks and a conjecture of H. Hadwiger. Proc. Lond. Math. Soc. 7, 161\u2013195 (1957)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"269","key":"2147_CR7","first-page":"150","volume":"268","author":"GA Dirac","year":"1974","unstructured":"Dirac, G.A.: The number of edges in critical graphs. J. Reine Angew. Math. 268(269), 150\u2013164 (1974)","journal-title":"J. Reine Angew. Math."},{"key":"2147_CR8","first-page":"3","volume":"XXVII","author":"P Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P.: Problems and results in number theory and graphs theory. Congr. Numer. XXVII, 3\u201321 (1979)","journal-title":"Congr. Numer."},{"key":"2147_CR9","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P., Neumann-Lara, V.: On the dichromatic number of a digraph. Technical Report (1982)","DOI":"10.1016\/0095-8956(82)90046-6"},{"key":"2147_CR10","first-page":"165","volume":"8","author":"T Gallai","year":"1963","unstructured":"Gallai, T.: Kritische Graphen I. Publ. Math. Inst. Hungar. Acad. Sci. 8, 165\u2013192 (1963)","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"2147_CR11","first-page":"373","volume":"8","author":"T Gallai","year":"1963","unstructured":"Gallai, T.: Kritische Graphen II. Publ. Math. Inst. Hungar. Acad. Sci. 8, 373\u2013395 (1963)","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"2147_CR12","doi-asserted-by":"publisher","first-page":"1734","DOI":"10.1016\/j.disc.2016.01.024","volume":"339","author":"N Golowich","year":"2016","unstructured":"Golowich, N.: The $$m$$-degenerate chromatic number of a digraph. Discrete Math. 339, 1734\u20131743 (2016)","journal-title":"Discrete Math."},{"key":"2147_CR13","doi-asserted-by":"crossref","first-page":"P195","DOI":"10.37236\/682","volume":"18","author":"A Harutyunyan","year":"2011","unstructured":"Harutyunyan, A., Mohar, B.: Strengthened Brooks theorem for digraphs of girth three. Electron. J. Comb. 18, P195 (2011)","journal-title":"Electron. J. Comb."},{"key":"2147_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-32439-3_9","volume":"15","author":"AV Kostochka","year":"2006","unstructured":"Kostochka, A.V.: Color-critical graphs and hypergraphs with few edges: a survey. More Sets Gr. Numbers Bolyai Soc. Math. Stud. 15, 175\u2013197 (2006)","journal-title":"More Sets Gr. Numbers Bolyai Soc. Math. Stud."},{"key":"2147_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jctb.2014.05.002","volume":"109","author":"AV Kostochka","year":"2014","unstructured":"Kostochka, A.V., Yancey, M.: Ore\u2019s conjecture on color-critical graphs is almost true. J. Comb. Theory Ser. B 109, 73\u2013101 (2014)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2147_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00493-014-3020-x","volume":"34","author":"AV Kostochka","year":"2014","unstructured":"Kostochka, A.V., Yancey, M.: Ore\u2019s conjecture for $$k=4$$ and Gr\u00f6tzsch theorem. Combinatorica 34, 323\u2013329 (2014)","journal-title":"Combinatorica"},{"key":"2147_CR17","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1137\/16M108080X","volume":"31","author":"Z Li","year":"2016","unstructured":"Li, Z., Mohar, B.: Planar digraphs of digirth four are $$2$$-colorabble. SIAM J. Discrete Math. 31, 2201\u20132205 (2016)","journal-title":"SIAM J. Discrete Math."},{"key":"2147_CR18","doi-asserted-by":"publisher","first-page":"2273","DOI":"10.1016\/j.laa.2009.05.027","volume":"432","author":"B Mohar","year":"2010","unstructured":"Mohar, B.: Eigenvalues and colorings of digraphs. Linear Algebra Appl. 432, 2273\u20132277 (2010)","journal-title":"Linear Algebra Appl."},{"key":"2147_CR19","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"M Mohar","year":"2001","unstructured":"Mohar, M., Thomassen, C.: Graphs on Surfaces. The John Hopkins University Press, Maryland (2001)"},{"key":"2147_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0095-8956(82)90046-6","volume":"33","author":"V Neumann-Lara","year":"1982","unstructured":"Neumann-Lara, V.: The dichromatic number of a digraph. J. Comb. Theory Ser. B 33, 265\u2013270 (1982)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2147_CR21","unstructured":"Neumann-Lara, V.: Vertex colourings in digraphs. Some problems. Seminar notes, University of Waterloo, July 8, 1985 (communicated by A. Bondy and S. Thomass\u00e9) (1985)"},{"key":"2147_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0012-365X(93)E0113-I","volume":"135","author":"V Neumann-Lara","year":"1994","unstructured":"Neumann-Lara, V.: The $$3$$- and $$4$$-chromatic tournaments of minimum order. Discrete Math. 135, 233\u2013243 (1994)","journal-title":"Discrete Math."},{"key":"2147_CR23","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1017\/CBO9781139519793.005","volume-title":"Topics in Chromatic Graph Theory. Encyclopedia of Mathematics and its Application","author":"M Stiebitz","year":"2015","unstructured":"Stiebitz, M., Toft, B.: Brooks\u2019s theorem. In: Beineke, L.W., Wilson, R.J. (eds.) Topics in Chromatic Graph Theory. Encyclopedia of Mathematics and its Application, vol. 165, pp. 36\u201355. Cambridge University Press, Cambridge (2015)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02147-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02147-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02147-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T23:11:52Z","timestamp":1695769912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02147-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,15]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2147"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02147-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,15]]},"assertion":[{"value":"3 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}