Deuber, W. A.; Kostochka, A. V.; Sachs, H. A shorter proof of the Dirac theorem on the number of edges in chromatically critical graphs. (Russian) Zbl 0920.05030 Diskretn. Anal. Issled. Oper. 3, No. 4, 28-34 (1996). All noncomplete \(k\)-critical graphs with minimum \(2| E(G)|- (k-1)| V(G)|\), where \(G\) is the simple finite \(k\)-critical graph, are characterized. Reviewer: J.Fiamčik (Prešov) Cited in 2 Documents MSC: 05C15 Coloring of graphs and hypergraphs Keywords:chromatic number; critical graph PDFBibTeX XMLCite \textit{W. A. Deuber} et al., Diskretn. Anal. Issled. Oper. 3, No. 4, 28--34 (1996; Zbl 0920.05030)