A different short proof of Brook's theorem
Discussiones Mathematicae. Graph Theory, Tome 34 (2014) no. 3, pp. 633-634

Voir la notice de l'article provenant de la source Library of Science

Lovász gave a short proof of Brooks’ theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case.
Keywords: coloring, clique number, maximum degree
@article{DMGT_2014_34_3_a15,
     author = {Rabern, Landon},
     title = {A different short proof of {Brook's} theorem},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {633--634},
     publisher = {mathdoc},
     volume = {34},
     number = {3},
     year = {2014},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2014_34_3_a15/}
}
TY  - JOUR
AU  - Rabern, Landon
TI  - A different short proof of Brook's theorem
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2014
SP  - 633
EP  - 634
VL  - 34
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2014_34_3_a15/
LA  - en
ID  - DMGT_2014_34_3_a15
ER  - 
%0 Journal Article
%A Rabern, Landon
%T A different short proof of Brook's theorem
%J Discussiones Mathematicae. Graph Theory
%D 2014
%P 633-634
%V 34
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2014_34_3_a15/
%G en
%F DMGT_2014_34_3_a15
Rabern, Landon. A different short proof of Brook's theorem. Discussiones Mathematicae. Graph Theory, Tome 34 (2014) no. 3, pp. 633-634. http://geodesic.mathdoc.fr/item/DMGT_2014_34_3_a15/