A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooksʹ theorem

A simple characterisation of cycles and complete graphs highlights their significance in Brooksʹ theorem. It then shows that an algorithmic proof of that theorem, usually dealt with in two cases, is in fact covered by one of the cases.