Pick the fewest vertices that touch every edge. Finding the smallest is NP-hard, but taking both ends of a matching is never more than twice too many.
This interactive visualization needs JavaScript.