{"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":1776870050201,"version":"3.51.2"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,8,21]],"date-time":"2014-08-21T00:00:00Z","timestamp":1408579200000},"content-version":"tdm","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":[[2015,10]]},"DOI":"10.1007\/s00493-014-2862-4","type":"journal-article","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T22:17:13Z","timestamp":1408573033000},"page":"619-631","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The edge density of critical digraphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Richard","family":"Hoshino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,21]]},"reference":[{"key":"2862_CR1","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.disc.2009.03.028","volume":"310","author":"G. Araujo-Pardo","year":"2010","unstructured":"G. Araujo-Pardo and M. Olsen: A conjecture of Neumann-Lara on infinite families of r-dichromatic circulant tournaments, Discrete Mathematics 310 (2010), 489\u2013492.","journal-title":"Discrete Mathematics"},{"key":"2862_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2012.08.003","volume":"103","author":"E. Berger","year":"2013","unstructured":"E. Berger, K. Choromanski, M. Chudnovsky, J. Fox, M. Loebl, A. Scott, P. Seymour and S. Thomass\u00e9: Tournaments and colouring, Journal of Combinatorial Theory Ser. B 103 (2013), 1\u201320.","journal-title":"Journal of Combinatorial Theory Ser. B"},{"key":"2862_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/jgt.20003","volume":"46","author":"D. Bokal","year":"2004","unstructured":"D. Bokal, G. Fijavz, M. Juvan, P. Kayll and B. Mohar: The circular chromatic number of a digraph, Journal of Graph Theory 46 (2004), 227\u2013240.","journal-title":"Journal of Graph Theory"},{"key":"2862_CR4","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0012-365X(78)90102-4","volume":"24","author":"B. Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s: Chromatic number, girth, and maximal degree, Discrete Mathematics 24 (1978), 311\u2013314.","journal-title":"Discrete Mathematics"},{"key":"2862_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-27.1.85","volume":"27","author":"G. A. Dirac","year":"1952","unstructured":"G. A. Dirac: A property of 4-chromatic graphs and some remarks on critical graphs, Journal of the London Mathematical Society 27 (1952), 85\u201392.","journal-title":"Journal of the London Mathematical Society"},{"key":"2862_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0166-218X(89)90045-0","volume":"25","author":"P. Erd\u0151s","year":"1989","unstructured":"P. Erd\u0151s and A. Hajnal: Ramsey-type theorems, Discrete Applied Mathematics 25 (1989), 37\u201352.","journal-title":"Discrete Applied Mathematics"},{"key":"2862_CR7","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/s00493-009-2267-y","volume":"29","author":"B. Farzad","year":"2009","unstructured":"B. Farzad and M. Molloy: On the edge density of 4-critical graphs, Combinatorica 29 (2009), 665\u2013689.","journal-title":"Combinatorica"},{"key":"2862_CR8","first-page":"165","volume":"8","author":"T. Gallai","year":"1963","unstructured":"T. Gallai: Kritische Graphen I, Publ. Math. Inst. Hungar. Acad. Sci. 8 (1963), 165\u2013192.","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"2862_CR9","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/100803870","volume":"25","author":"A. Harutyunyan","year":"2011","unstructured":"A. Harutyunyan and B. Mohar: Gallai\u2019s theorem for list coloring of digraphs, SIAM Journal on Discrete Mathematics 25 (2011), 170\u2013180.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2862_CR10","doi-asserted-by":"crossref","first-page":"1823","DOI":"10.1016\/j.disc.2012.01.028","volume":"312","author":"A. Harutyunyan","year":"2012","unstructured":"A. Harutyunyan and B. Mohar: Two results on the digraph chromatic number, Discrete Mathematics 312 (2012), 1823\u20131826.","journal-title":"Discrete Mathematics"},{"key":"2862_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0012-365X(02)00262-5","volume":"258","author":"T. R. Jensen","year":"2002","unstructured":"T. R. Jensen: Dense critical and vertex-critical graphs, Discrete Mathematics 258 (2002), 63\u201384.","journal-title":"Discrete Mathematics"},{"key":"2862_CR12","volume-title":"Graph coloring problems","author":"T. R. Jensen","year":"1995","unstructured":"T. R. Jensen and B. Toft: Graph coloring problems, New York, Wiley Interscience, 1995."},{"key":"2862_CR13","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/S0095-8956(02)00035-7","volume":"87","author":"A. V. Kostochka","year":"2003","unstructured":"A. V. Kostochka and M. Stiebitz: A new lower bound on the number of edges in colour-critical graphs and hypergraphs, Journal of Combinatorial Theory Series B 87 (2003), 374\u2013402.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"2862_CR14","unstructured":"A. V. Kostochka and M. Yancey: Ore\u2019s Conjecture on color-critical graphs is almost true, to appear."},{"key":"2862_CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0095-8956(82)90046-6","volume":"33","author":"V. Neumann-Lara","year":"1982","unstructured":"V. Neumann-Lara: The dichromatic number of a digraph, Journal of Combinatorial Theory Series B 33 (1982), 265\u2013270.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"2862_CR16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0012-365X(93)E0113-I","volume":"135","author":"V. Neumann-Lara","year":"1994","unstructured":"V. Neumann-Lara: The 3 and 4-dichromatic tournaments of minimum order, Discrete Mathematics 135 (1994), 233\u2013243.","journal-title":"Discrete Mathematics"},{"key":"2862_CR17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/jgt.10106","volume":"43","author":"B. Mohar","year":"2003","unstructured":"B. Mohar: Circular colorings of edge-weighted graphs, Journal of Graph Theory 43 (2003), 107\u2013116.","journal-title":"Journal of Graph Theory"},{"key":"2862_CR18","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1016\/j.laa.2009.05.027","volume":"432","author":"B. Mohar","year":"2010","unstructured":"B. Mohar: Eigenvalues and colorings of graphs, Linear Algebra and its Applications 432 (2010), 2273\u20132277.","journal-title":"Linear Algebra and its Applications"},{"key":"2862_CR19","first-page":"461","volume":"5","author":"B. Toft","year":"1970","unstructured":"B. Toft: On the maximal number of edges of critical k-chromatic graphs, Studia Scientiarum Mathematicarum Hungarica 5 (1970), 461\u2013470.","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"key":"2862_CR20","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"P. Tur\u00e1n: On an extremal problem in graph theory, Mat. Fiz. Lapok 48 (1941), 436\u2013452.","journal-title":"Mat. Fiz. Lapok"},{"key":"2862_CR21","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1112\/jlms\/s1-42.1.330","volume":"42","author":"H. S. Wilf","year":"1967","unstructured":"H. S. Wilf: The eigenvalues of a graph and its chromatic number, Journal of the London Mathematical Society 42 (1967), 330\u2013332.","journal-title":"Journal of the London Mathematical Society"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2862-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2862-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2862-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:50Z","timestamp":1559093570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2862-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,21]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["2862"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2862-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,21]]}}}