{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:39Z","timestamp":1759637919678},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"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":5433,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0012-365x(98)00100-9","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:18:15Z","timestamp":1049483895000},"page":"125-137","source":"Crossref","is-referenced-by-count":7,"title":["Colour-critical graphs with few edges"],"prefix":"10.1016","volume":"191","author":[{"given":"A.V.","family":"Kostochka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Stiebitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00100-9_BIB1","first-page":"194","article-title":"On colouring the nodes of a network","volume":"37","author":"Brooks","year":"1941"},{"key":"10.1016\/S0012-365X(98)00100-9_BIB2","first-page":"161","article-title":"A theorem of R.L. Brooks and a conjecture of H. Hadwiger","volume":"7","author":"Dirac","year":"1957"},{"key":"10.1016\/S0012-365X(98)00100-9_BIB3","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\/S0012-365X(98)00100-9_BIB4","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\/S0012-365X(98)00100-9_BIB5","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\/S0012-365X(98)00100-9_BIB6","series-title":"Graph Coloring Problems, Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"Jensen","year":"1995"},{"key":"10.1016\/S0012-365X(98)00100-9_BIB7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0012-365X(95)00294-7","article-title":"The colour theorems of Brooks and Gallai extended","volume":"162","author":"Kostochka","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00100-9_BIB8","unstructured":"M. Krivelevich, An improved bound on the minimal number of edges in color-critical graphs, submitted."},{"key":"10.1016\/S0012-365X(98)00100-9_BIB9","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"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001009?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001009?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:54:13Z","timestamp":1556117653000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0012365X98001009"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00100-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}