{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:20:05Z","timestamp":1758824405189},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s00493-009-2267-y","type":"journal-article","created":{"date-parts":[[2010,8,23]],"date-time":"2010-08-23T00:50:49Z","timestamp":1282524649000},"page":"665-689","source":"Crossref","is-referenced-by-count":6,"title":["On the edge-density of 4-critical graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Babak","family":"Farzad","sequence":"first","affiliation":[]},{"given":"Michael","family":"Molloy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,24]]},"reference":[{"issue":"7","key":"2267_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1112\/plms\/s3-7.1.161","volume":"3","author":"G. A. Dirac","year":"1957","unstructured":"G. A. Dirac: A theorem of R. L. Brooks and a conjecture of H. Hadwiger, Proc. London Math. Soc. 3(7) (1957), 161\u2013195.","journal-title":"Proc. London Math. Soc."},{"key":"2267_CR2","first-page":"150","volume":"268\/269","author":"G. A. Dirac","year":"1974","unstructured":"G. A. Dirac: The number of edges in critical graphs, J. Reine Angew. Math. 268\/269 (1974), 150\u2013164. Collection of articles dedicated to Helmut Hasse on his seventy-fifth birthday, II.","journal-title":"J. Reine Angew. Math."},{"key":"2267_CR3","unstructured":"B. Farzad: On colourings of graphs, Thesis (PhD), University of Toronto, 2005."},{"key":"2267_CR4","first-page":"165","volume":"8","author":"T. Gallai","year":"1963","unstructured":"T. Gallai: Kritische Graphen, I; Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 8 (1963), 165\u2013192.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"2267_CR5","volume-title":"Graph coloring problems","author":"T. R. Jensen","year":"1995","unstructured":"T. R. Jensen and B. Toft: Graph coloring problems, John Wiley & Sons Inc., New York, 1995. A Wiley-Interscience Publication."},{"key":"2267_CR6","doi-asserted-by":"crossref","first-page":"805","DOI":"10.4153\/CJM-1972-078-3","volume":"24","author":"H. V. Kronk","year":"1972","unstructured":"H. V. Kronk and J. Mitchem: On Dirac\u2019s generalization of Brooks\u2019 theorem, Canad. J. Math. 24 (1972), 805\u2013807.","journal-title":"Canad. J. Math."},{"key":"2267_CR7","unstructured":"M. Krivelevich: An improved bound on the minimal number of edges in colorcritical graphs, Electron. J. Combin. 5(1) (1998), Research Paper 4, 4 pp. (electronic)."},{"issue":"1\u20133","key":"2267_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0012-365X(98)00100-9","volume":"191","author":"A. V. Kostochka","year":"1998","unstructured":"A. V. Kostochka and M. Stiebitz: Colour-critical graphs with few edges, Discrete Math. 191(1\u20133) (1998), 125\u2013137. Graph theory (Elgersburg, 1996).","journal-title":"Discrete Math."},{"key":"2267_CR9","first-page":"87","volume-title":"Graph theory and combinatorial biology (Balatonlelle, 1996)","author":"A. V. Kostochka","year":"1999","unstructured":"A. V. Kostochka and M. Stiebitz: Excess in colour-critical graphs, in: Graph theory and combinatorial biology (Balatonlelle, 1996), pages 87\u201399, J\u00e1nos Bolyai Math. Soc., Budapest, 1999."},{"issue":"2","key":"2267_CR10","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 color-critical graphs and hypergraphs, J. Combin. Theory Ser. B 87(2) (2003), 374\u2013402.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2267_CR11","first-page":"84","volume":"299\/300","author":"J. Mitchem","year":"1978","unstructured":"J. Mitchem: A new proof of a theorem of Dirac on the number of edges in critical graphs, J. Reine Angew. Math. 299\/300 (1978), 84\u201391.","journal-title":"J. Reine Angew. Math."},{"issue":"3","key":"2267_CR12","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02579239","volume":"2","author":"M. Stiebitz","year":"1982","unstructured":"M. Stiebitz: Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs, Combinatorica 2(3) (1982), 315\u2013323.","journal-title":"Combinatorica"},{"key":"2267_CR13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0095-8956(75)90058-1","volume":"18","author":"J. Weinstein","year":"1975","unstructured":"J. Weinstein: Excess in critical graphs, J. Combin. Theory Ser. B 18 (1975), 24\u201331.","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2267-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-009-2267-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2267-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:46Z","timestamp":1559093566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-009-2267-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["2267"],"URL":"https:\/\/doi.org\/10.1007\/s00493-009-2267-y","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}