On Brooks' Theorem
Gopalan Sajith (1), Sanjeev Saxena (2) ((1) IIT Guwahati, (2) IIT Kanpur)
TL;DR
This paper presents two simplified proofs of Brooks' Theorem, aiming to make the theorem more accessible for teaching in computer science courses.
Contribution
It introduces two new, easier-to-understand proofs of Brooks' Theorem by modifying and combining existing proofs.
Findings
Two alternative proofs of Brooks' Theorem
Proofs are easier to teach and understand
Enhances educational approaches in computer science
Abstract
In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTeaching and Learning Programming · Distributed and Parallel Computing Systems · Computability, Logic, AI Algorithms