A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs

Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal

A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ c…