On Non-Essential Edges in 3-Connected Graphs
β Scribed by Talmage James Reid; Haidong Wu
- Publisher
- Springer Japan
- Year
- 2000
- Tongue
- English
- Weight
- 249 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present a reduction theorem for the class of all finite 3-connected graphs which does not make use of the traditional contraction of certain connected subgraphs. ## 1998 Academic Press Contractible edges play an important role in the theory of 3-connected graphs. Besides the famous wheel theore
## Abstract An edge __e__ of a 3βconnected graph __G__ is said to be __removable__ if __G__ β __e__ is a subdivision of a 3βconnected graph. If __e__ is not removable, then __e__ is said to be __nonremovable.__ In this paper, we study the distribution of removable edges in 3βconnected graphs and pr