{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T03:19:02Z","timestamp":1774063142001,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3791,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0095-8956(02)00035-7","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T18:57:26Z","timestamp":1045508246000},"page":"374-402","source":"Crossref","is-referenced-by-count":13,"title":["A new lower bound on the number of edges in colour-critical graphs and hypergraphs"],"prefix":"10.1016","volume":"87","author":[{"given":"Alexandr V.","family":"Kostochka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Stiebitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(02)00035-7_BIB1","unstructured":"O.V. Borodin, A criterion of choosability of graphs with degree size list assignments, in: Abstracts of IV All-Union Conference on Theoretical Cybernetics, Novosibirsk, 1977, pp. 127\u2013128 (in Russian)."},{"key":"10.1016\/S0095-8956(02)00035-7_BIB2","unstructured":"O.V. Borodin, Problems of colouring and of covering the vertex set of a graph by induced subgraphs, Ph.D. Thesis, Institute of Mathematics, Novosibirsk, 1979 (in Russian)."},{"key":"10.1016\/S0095-8956(02)00035-7_BIB3","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","article-title":"On colouring the nodes of a network","volume":"37","author":"Brooks","year":"1941","journal-title":"Proc. Cambridge Philos. Soc."},{"issue":"4","key":"10.1016\/S0095-8956(02)00035-7_BIB4","first-page":"28","article-title":"A shorter proof of Dirac's theorem on the number of edges in chromatically critical graphs","volume":"3","author":"Deuber","year":"1996","journal-title":"Diskretnyi Analiz Issledovanie Operacii"},{"key":"10.1016\/S0095-8956(02)00035-7_BIB5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01238034","article-title":"Note on the colouring of graphs","volume":"54","author":"Dirac","year":"1951","journal-title":"Math. Z."},{"issue":"3","key":"10.1016\/S0095-8956(02)00035-7_BIB6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1112\/plms\/s3-7.1.161","article-title":"A theorem of R. L. Brooks and a conjecture of H. Hadwiger","volume":"7","author":"Dirac","year":"1957","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/S0095-8956(02)00035-7_BIB7","first-page":"150","article-title":"The number of edges in critical graphs","volume":"268\/269","author":"Dirac","year":"1974","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/S0095-8956(02)00035-7_BIB8","first-page":"125","article-title":"Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing","volume":"XXVI","author":"Erd\u00f6s","year":"1979","journal-title":"Congr. Numer."},{"key":"10.1016\/S0095-8956(02)00035-7_BIB9","first-page":"165","article-title":"Kritische Graphen I","volume":"8","author":"Gallai","year":"1963","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/S0095-8956(02)00035-7_BIB10","first-page":"373","article-title":"Kritische Graphen II","volume":"8","author":"Gallai","year":"1963","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/S0095-8956(02)00035-7_BIB11","first-page":"116","article-title":"\u00dcber eine Konstruktion nicht n-f\u00e4rbbarer Graphen","volume":"10","author":"Haj\u00f3s","year":"1961","journal-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Naturw. Reihe"},{"key":"10.1016\/S0095-8956(02)00035-7_BIB12","series-title":"Graph Coloring Problems, Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"Jensen","year":"1995"},{"key":"10.1016\/S0095-8956(02)00035-7_BIB13","unstructured":"A.V. Kostochka, M. Stiebitz, Excess in colour-critical graphs, in: Graph Theory and Combinatorial Biology, Balatonlelle (Hungary), 1996, Bolyai Society, Mathematical Studies, Vol. 7, Budapest, 1999, pp. 87\u201399."},{"key":"10.1016\/S0095-8956(02)00035-7_BIB14","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s004930070005","article-title":"On the number of edges in colour-critical graphs and hypergraphs","volume":"20","author":"Kostochka","year":"2000","journal-title":"Combinatorica"},{"key":"10.1016\/S0095-8956(02)00035-7_BIB15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/jgt.998","article-title":"A list version of Dirac's theorem on the number of edges in colour-critical graphs","volume":"39","author":"Kostochka","year":"2002","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(02)00035-7_BIB16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0012-365X(98)00100-9","article-title":"The colour theorems of Brooks and Gallai extended","volume":"191","author":"Kostochka","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(02)00035-7_BIB17","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF01215921","article-title":"On the minimal number of edges in color-critical graphs","volume":"17","author":"Krivelevich","year":"1997","journal-title":"Combinatorica"},{"key":"10.1016\/S0095-8956(02)00035-7_BIB18","doi-asserted-by":"crossref","first-page":"805","DOI":"10.4153\/CJM-1972-078-3","article-title":"On Dirac's generalization of Brooks\u2019 theorem","volume":"24","author":"Kronk","year":"1972","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0095-8956(02)00035-7_BIB19","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0095-8956(02)00035-7_BIB20","series-title":"The Four Colour Problem","author":"Ore","year":"1967"},{"key":"10.1016\/S0095-8956(02)00035-7_BIB21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02579239","article-title":"Proof of a conjecture of T. Gallai concerning connectivities properties of colour-critical graphs","volume":"2","author":"Stiebitz","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/S0095-8956(02)00035-7_BIB22","first-page":"3","article-title":"Colouring the vertices of a graph with prescribed colours","volume":"29","author":"Vizing","year":"1976","journal-title":"Metody Diskretnogo Analiza Teorii Kodov Skhem"},{"key":"10.1016\/S0095-8956(02)00035-7_BIB23","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0095-8956(75)90058-1","article-title":"Excess in critical graphs","volume":"18","author":"Weinstein","year":"1975","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000357?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000357?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T14:23:02Z","timestamp":1553955782000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895602000357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0095895602000357"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(02)00035-7","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}