김동규

Tutte (1961) proved that every simple $3$-connected graph $G$ has an edge $e$ such that $G\setminus e$ or $G/e$ is simple $3$-connected, unless $G$ is isomorphic to a wheel. We call such an edge non-essential. Oxley and Wu (2000) proved that every simple $3$-connected graph has at least $2$ non-essential edges unless …