Combinatorics / CONCEPT

Weighted induced deletion

Consider a finite simple graph with a proper coloring by three colors. A mixed vertex has neighbors of two different colors. A collection of mixed vertices of degree two can be deleted at a controlled cost when each of their neighbors is nonmixed and has only that vertex as a mixed neighbor. The control is an inequality between the reciprocal potentials of the original graph and the actual induced graph on the surviving vertices.