Graph TheoryChallengeTrees
Trees · Challenge problem
What is the fewest edges to delete from the Petersen graph (10 vertices, 15 edges) to leave a spanning tree?
What is the fewest edges to delete from the Petersen graph (10 vertices, 15 edges) to leave a spanning tree?