The 3-connected graphs with exactly three non-essential edges
An edge e of a simple 3-connected graph G is essential if neither the deletion G\e nor the contraction G/e is both simple and 3-connected. Tutte's Wheels Theorem proves that the only simple 3-connected graphs with no non-essential edges are the wheels. In earlier work, as a corollary of a matroid result, the authors determined all simple 3-connected graphs with at most two non-essential edges. This paper specifies all such graphs with exactly three non-essential edges. As a consequence, with the exception of the members of 10 classes of graphs, all 3-connected graphs have at least four non-essential edges. © Springer-Verlag 2004.
Publication Source (Journal or Book title)
Graphs and Combinatorics
Oxley, J., & Wu, H. (2004). The 3-connected graphs with exactly three non-essential edges. Graphs and Combinatorics, 20 (2), 233-246. https://doi.org/10.1007/s00373-004-0552-5