Let S be the class of all graphs such that K4 T H for all H in S. Let G be a graph that is not in S with the property that for all e E EG, we have G\e E S. Prove that G is 2-connected.