Abstract: We
show that if G
is a 3-connected graph of order at least 5,
then there exists a longest cycle C of G such that the
number of contractible edges of G
which are on C
is greater than or equal to
Keywords and phrases: 3-connected graph, contractible edge, longest cycle.