A Different Short Proof of Brooks’ Theorem
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.
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2014-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1721 |