𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Removable edges of cycles in 5-connected graphs

✍ Scribed by Haiyan Kang; Jichang Wu; Guojun Li

Book ID
107619731
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
341 KB
Volume
28
Category
Article
ISSN
1598-5865

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

Removable edges in cycles of ak-connecte
Removable edges in cycles of ak-connected graph
✍ Li Qiong Xu; Xiao Feng Guo πŸ“‚ Article πŸ“… 2011 πŸ› Institute of Mathematics, Chinese Academy of Scien 🌐 English βš– 194 KB
The Number of Removable Edges in 3-Conne
The Number of Removable Edges in 3-Connected Graphs
✍ Su Jianji πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 147 KB

An edge of a 3-connected graph G is said to be removable if G&e is a subdivision of a 3-connected graph. Holton et al. (1990) proved that every 3-connected graph of order at least five has at least W(|G| +10)Γ‚6X removable edges. In this paper, we prove that every 3-connected graph of order at least