The reverse mathematics of Brooks' theorem

This is an analysis of the status of Brooks’ Theorem, a celebrated result in graph coloring, from the point of view of Reverse Mathematics. We prove that the restriction of Brooks’ theorem to bounded graphs of degree greater than or equal to $3$ is provable in ${\mathsf{R}\mathsf{C}\mathsf{A}}_0$, while the statement for arbitrary graphs is equivalent to ${\mathsf{W}\mathsf{K}\mathsf{L}}_0$ over ${\mathsf{R}\mathsf{C}\mathsf{A}}_0$. Brooks’ Theorem for degree $2$, even when restricted to bounded graphs, is equivalent to ${\mathsf{W}\mathsf{K}\mathsf{L}}_0$ over ${\mathsf{R}\mathsf{C}\mathsf{A}}_0$.