Given a graph G = (V;E) and a set of terminal vertices T we say that a superset S of T is T -connecting if S induces a connected graph, and S is minimal if no strict subset of S is T -connecting. In this paper we prove that there are at most jVnTj jTj 2 3 jVnTj
['Jan Arne Telle', 'Yngve Villanger']
Connecting Terminals and 2-Disjoint Connected Subgraphs