For a graph G we define a graph T (G) whose vertices are the triangles in G and two vertices of T (G) are adjacent if their corresponding triangles in G share an edge. Kawarabayashi showed that if G is a k-connected graph and T (G) contains no edge then G admits a kcontractible clique of size at most 3, generalizing an earlier result of Thomassen. In this paper, we further generalize Kawarabaya...