In a graph, the number of edges leading to a vertex is its valence. If an edge connects two vertices of valence three, that edge and its vertices can be deleted to form a new graph. Both edge excision and its opposite, edge insertion, are widely used in the study of cage graphs. The graphs at the bottom are all possible distinct excisions of various cubic graphs.