To get a minimum spanning tree, instead of adding shortest

To get a minimum spanning tree, instead of adding shortest edges, one could think of deleting longest edges. For what graphs would this be feasible? Describe an algorithm for this.

PROBLEM SET 23.3: