McCuaig and Ota conjectured that every sufficiently large 3-connected graph
G contains a connected subgraph H on k vertices such that G - V(H) is 2-co
nnected. We prove the weaker statement that every sufficiently large 3-conn
ected graph G contains a not necessarily connected subgraph H on k vertices
such that G - V(H) is 2-connected. (C) 2001 Academic Press.