{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T03:18:59Z","timestamp":1774063139584,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T00:00:00Z","timestamp":1502668800000},"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":[[2018,10]]},"DOI":"10.1007\/s00493-016-3584-6","type":"journal-article","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T10:12:24Z","timestamp":1502705544000},"page":"1045-1065","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Edge Lower Bounds for List Critical Graphs, Via Discharging"],"prefix":"10.1007","volume":"38","author":[{"given":"Daniel W.","family":"Cranston","sequence":"first","affiliation":[]},{"given":"Landon","family":"Rabern","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,14]]},"reference":[{"key":"3584_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N. Alon","year":"1992","unstructured":"N. Alon and M. Tarsi: Colorings and orientations of graphs, Combinatorica 12 (1992), 125\u2013134.","journal-title":"Combinatorica"},{"key":"3584_CR2","first-page":"194","volume-title":"Mathematical Proceedings of the Cambridge Philosophical Society","author":"R. L. Brooks","year":"1941","unstructured":"R. L. Brooks: On colouring the nodes of a network, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 37, Cambridge Univ Press, 1941, 194\u2013197."},{"key":"3584_CR3","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.disc.2016.11.022","volume":"340","author":"D. W. Cranston","year":"2017","unstructured":"D. W. Cranston and D. B. West: An introduction to the discharging method via graph coloring, Discrete Math 340 (2017), 766\u2013793. extended version: A guide to the discharging method, https:\/\/arxiv.org\/abs\/1306.4434v1 (2013).","journal-title":"Discrete Math"},{"issue":"1","key":"3584_CR4","volume":"3","year":"1957","unstructured":"G. A. Dirac: A theorem of R. L. Brooks and a conjecture of H. Hadwiger, Proceedings of the London Mathematical Society 3 (1957), no. 1, 161\u2013195.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"3584_CR5","first-page":"125","volume-title":"Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium","author":"P. Erd\u0151s","year":"1979","unstructured":"P. Erd\u0151s, A. L. Rubin and H. Taylor: Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 26, 1979, 125\u2013157.","edition":"26"},{"key":"3584_CR6","first-page":"165","volume":"8","author":"T. Gallai","year":"1963","unstructured":"T. Gallai: Kritische Graphen I., Publications of the Mathematical Institute of the Hungarian Academy of Sciences 8 (1963), 165\u2013192 (in German).","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"3584_CR7","doi-asserted-by":"publisher","first-page":"3426","DOI":"10.1016\/j.disc.2010.07.019","volume":"310","author":"J. Hladk\u00fd","year":"2010","unstructured":"J. Hladk\u00fd, D. Kr\u00e1l\u2019 and U. Schauz: Brooks\u2019 theorem via the Alon\u2013Tarsi theorem, Discrete Mathematics 310 (2010), 3426\u20133428.","journal-title":"Discrete Mathematics"},{"key":"3584_CR8","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.jctb.2008.06.007","volume":"99","author":"H. A. Kierstead","year":"2009","unstructured":"H. A. Kierstead and A. V. Kostochka: Ore-type versions of Brooks\u2019 theorem, Journal of Combinatorial Theory, Series B 99 (2009), 298\u2013305.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3584_CR9","volume-title":"Improved lower bounds on the number of edges in list critical and online list critical graphs","author":"H. A. Kierstead","year":"2014","unstructured":"H. A. Kierstead and L. Rabern: Improved lower bounds on the number of edges in list critical and online list critical graphs, arXiv preprint http:\/\/arxiv.org\/abs\/1406.7355 (2014)."},{"key":"3584_CR10","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.disc.2011.12.014","volume":"312","author":"A. V. Kostochka","year":"2012","unstructured":"A. V. Kostochka, L. Rabern and M. Stiebitz: Graphs with chromatic number close to maximum degree, Discrete Mathematics 312 (2012), 1273\u20131281.","journal-title":"Discrete Mathematics"},{"key":"3584_CR11","doi-asserted-by":"publisher","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":"3584_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00493-014-3020-x","volume":"34","author":"A. V. Kostochka","year":"2014","unstructured":"A. V. Kostochka and M. Yancey: Ore\u2019s conjecture for k=4 and Gr\u00f6tzsch\u2019s theorem, Combinatorica 34 (2014), 323\u2013329.","journal-title":"Combinatorica"},{"key":"3584_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jctb.2014.05.002","volume":"109","author":"A. V. Kostochka","year":"2014","unstructured":"A. V. Kostochka and M. Yancey: Ore\u2019s conjecture on color-critical graphs is almost true, Journal of Combinatorial Theory, Series B 109 (2014), 73\u2013101.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3584_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF01215921","volume":"17","author":"M. Krivelevich","year":"1997","unstructured":"M. Krivelevich: On the minimal number of edges in color-critical graphs, Combinatorica 17 (1997), 401\u2013426.","journal-title":"Combinatorica"},{"key":"3584_CR15","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jctb.2011.05.003","volume":"102","author":"L. Rabern","year":"2012","unstructured":"L. Rabern: \u0394-critical graphs with small high vertex cliques, Journal of Combinatorial Theory, Series B 102 (2012), 126\u2013130.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3584_CR16","doi-asserted-by":"publisher","first-page":"3373","DOI":"10.1016\/j.disc.2012.07.035","volume":"312","author":"A. Riasat","year":"2012","unstructured":"A. Riasat and U. Schauz: Critically paintable, choosable or colorable graphs, Discrete Mathematics 312 (2012), 3373\u20133383.","journal-title":"Discrete Mathematics"},{"key":"3584_CR17","doi-asserted-by":"crossref","first-page":"R77","DOI":"10.37236\/166","volume":"16","author":"U. Schauz","year":"2009","unstructured":"U. Schauz: Mr. Paint and Mrs. Correct, The Electronic Journal of Combinatorics 16 (2009), R77.","journal-title":"The Electronic Journal of Combinatorics"},{"key":"3584_CR18","doi-asserted-by":"crossref","first-page":"R13","DOI":"10.37236\/285","volume":"17","author":"U. Schauz","year":"2010","unstructured":"U. Schauz: Flexible color lists in Alon and Tarsi\u2019s theorem, and time scheduling with unreliable participants, The Electronic Journal of Combinatorics 17 (2010), R13.","journal-title":"The Electronic Journal of Combinatorics"},{"key":"3584_CR19","doi-asserted-by":"publisher","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 (1982), 315\u2013323.","journal-title":"Combinatorica"},{"key":"3584_CR20","first-page":"3","volume":"29","author":"V. G. Vizing","year":"1976","unstructured":"V. G. Vizing; Vextex coloring with given colors, Metody Diskretnogo Analiza 29 (1976), 3\u201310 (in Russian).","journal-title":"Metody Diskretnogo Analiza"},{"key":"3584_CR21","doi-asserted-by":"crossref","first-page":"R127","DOI":"10.37236\/216","volume":"16","author":"X. Zhu","year":"2009","unstructured":"X. Zhu: On-line list colouring of graphs, The Electronic Journal of Combinatorics 16 (2009), R127.","journal-title":"The Electronic Journal of Combinatorics"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3584-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3584-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3584-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T05:21:38Z","timestamp":1602739298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3584-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,14]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["3584"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3584-6","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,14]]}}}