MathDB

4

Part of 2019 HMIC

Problems(1)

Cactus graphs

Source: HMIC 2019 Problem 4

4/28/2019
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
combinatoricsgraph theoryHMIC