𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The 3-Connected Graphs with ExactlykNon-Essential Edges

✍ Scribed by Yuxing Liu

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
269 KB
Volume
26
Category
Article
ISSN
0911-0119

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

Contractible edges in 3-connected graphs
Contractible edges in 3-connected graphs
✍ Kiyoshi Ando; Hikoe Enomoto; Akira Saito πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 371 KB
Contractible Non-edges in 3-Connected Gr
Contractible Non-edges in 3-Connected Graphs
✍ Matthias Kriesell πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 495 KB

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

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