A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem (Q1815327)

It is proved that for a 2-connected graph \(G\) the following three statements are equivalent: (i) \(G\) is either a complete graph or a cycle; (ii) the removal from \(G\) of any two non-adjacent vertices disconnects it; (iii) the removal from \(G\) of any two vertices of distance 2 apart disconnects it. This produces an algorithmic short proof of Brooks' theorem.