𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Removable edges in a 5-connected graph and a construction method of 5-connected graphs

✍ Scribed by Liqiong Xu; Xiaofeng Guo

Book ID
108113739
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
152 KB
Volume
308
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Removable edges in 3-connected graphs
Removable edges in 3-connected graphs
✍ Derek A. Holton; Bill Jackson; Akira Saito; Nicholas C. Wormald πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 404 KB

## 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