Properties of graphs containing wild components

A wild component is a connected subgraph having at least three vertices and containing the minimum number of edges whose locations are unspecified. In a VLSI or on a printed board, there are points which can be connected in any wiring pattern as long as they are connected together. These points can be represented by a wild component, and it is shown that the properties of cutsets and loops (circuits) with wild components are almost the same as those without wild components. Furthermore, a process of obtaining a planar graph from another planar graph containing wild components is very similar to one when there are no wild components