is a special case of vertex identification.) The operation may occur on any pair (or subset) of vertices in the graph. Edges between two contracting vertices are sometimes removed. If and are vertices of distinct components of , then we can create a new graph by identifying and in as a new vertex in . More generally, given a partition of the vertex set, one can identify vertices in the partition; the resulting graph is known as a quotient graph.

Vertex cleaving