On contractible edges in 3-connected graphs

Abstract

The existence of contractible edges is a very useful tool in graph theory. For 3-connected graphs with at least six vertices, Ota and Saito (1988) prove that the set of contractible edges cannot be covered by two vertices. Saito (1990) prove that if a three-element vertex set S covers all contractible edges of a 3-connected graph G, then S is a vertex-cut… (More)

Topics

Cite this paper

@article{Tan2004OnCE, title={On contractible edges in 3-connected graphs}, author={Fei Tan and Haidong Wu}, journal={Australasian J. Combinatorics}, year={2004}, volume={30}, pages={141-146} }