Abstract.
An edge e in a simple 3-connected graph is deletable (simple-contractible) if the deletion G\e (contraction G/e) is both simple and 3-connected. Suppose a, b, and c are three non-negative integers. If there exists a simple 3-connected graph with exactly a edges which are deletable but not simple-contractible, exactly b edges which are simple-contractible but not deletable, and exactly c edges which are both deletable and simple-contractible, then we call the triple (a, b, c) realizable, and such a graph is said to be an (a, b, c)-graph. Tutte's Wheels Theorem says the only (0, 0, 0)-graphs are the wheels. In this paper, we characterize the (a, b, c) realizable triples for which at least one of a + b≤2, c=0, and c≥16 holds.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: February 12, 1997 Revised: February 13, 1998
Rights and permissions
About this article
Cite this article
Reid, T., Wu, H. On Non-Essential Edges in 3-Connected Graphs. Graphs Comb 16, 337–354 (2000). https://doi.org/10.1007/s003730070015
Issue Date:
DOI: https://doi.org/10.1007/s003730070015