Cactus graphs
Source: HMIC 2019 Problem 4
April 28, 2019
combinatoricsgraph theoryHMIC
Problem Statement
A cactus is a finite simple connected graph where no two cycles share an edge. Show that in a nonempty cactus, there must exist a vertex which is part of at most one cycle.Kevin Yang