Let G be a simple 3-connected graph with at least five vertices. Tutte [13] showed that G has at least one contractible edge. Thomassen [11] gave a simple proof of this fact and showed that contractible edges have many applications. In this paper, we show that there are at most |V (G)| 5 vertices that are not incident to contractible edges in a 3-connected… (More)

@article{Wu2003ContractibleEI,
title={Contractible Elements in Graphs and Matroids},
author={Haidong Wu},
journal={Combinatorics, Probability & Computing},
year={2003},
volume={12},
pages={457-465}
}