Abstract: An edge e of
a 3-connected graph G is said to be
contractible if the contraction of G results
in a 3-connected graph; otherwise e is
said to be noncontractible. In this paper, we obtain an upper bound on the
number of noncontractible edges in a 3-connected graph of order p,
which is best possible for all
Keywords and phrases: 3-connected graph, noncontractible edge.
