Prove that the complete bipartite graph Ks,t is 2-connected for any s ≥ 2 and t ≥ 2.
You might start with Exercise 1c in this article
http://www.maths.lse.ac.uk/Personal/jozef/MA210/07sol.pdf
amazing how often a few seconds with google can go a long way.