A~very short proof of Dirac's theorem on the number of edges in chromatically critical graphs
Diskretnyj analiz i issledovanie operacij, Tome 3 (1996) no. 4, pp. 28-34.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_1996_3_4_a1,
     author = {V. A. Doiber and A. V. Kostochka and H. Sachs},
     title = {A~very short proof of {Dirac's} theorem on the number of edges in chromatically critical graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {28--34},
     publisher = {mathdoc},
     volume = {3},
     number = {4},
     year = {1996},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1996_3_4_a1/}
}
TY  - JOUR
AU  - V. A. Doiber
AU  - A. V. Kostochka
AU  - H. Sachs
TI  - A~very short proof of Dirac's theorem on the number of edges in chromatically critical graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1996
SP  - 28
EP  - 34
VL  - 3
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1996_3_4_a1/
LA  - ru
ID  - DA_1996_3_4_a1
ER  - 
%0 Journal Article
%A V. A. Doiber
%A A. V. Kostochka
%A H. Sachs
%T A~very short proof of Dirac's theorem on the number of edges in chromatically critical graphs
%J Diskretnyj analiz i issledovanie operacij
%D 1996
%P 28-34
%V 3
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1996_3_4_a1/
%G ru
%F DA_1996_3_4_a1
V. A. Doiber; A. V. Kostochka; H. Sachs. A~very short proof of Dirac's theorem on the number of edges in chromatically critical graphs. Diskretnyj analiz i issledovanie operacij, Tome 3 (1996) no. 4, pp. 28-34. http://geodesic.mathdoc.fr/item/DA_1996_3_4_a1/