𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Removable edges in cycles of ak-connected graph

✍ Scribed by Li Qiong Xu; Xiao Feng Guo

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2011
Tongue
English
Weight
194 KB
Volume
27
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cutsets in ak-connected graph
Cutsets in ak-connected graph
✍ D. V. Karpov πŸ“‚ Article πŸ“… 2007 πŸ› Springer US 🌐 English βš– 243 KB
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

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

Edge-disjoint paths and cycles in n-edge
Edge-disjoint paths and cycles in n-edge-connected graphs
✍ Andreas Huck πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 826 KB

## Abstract We consider finite undirected loopless graphs __G__ in which multiple edges are possible. For integers k,l β‰₯ 0 let g(k, l) be the minimal __n__ β‰₯ 0 with the following property: If __G__ is an __n__‐edge‐connected graph, __s__~1~, ⃛,__s__~k~, __t__~1~, ⃛,__t__~k~ are vertices of __G__, a