๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Contractible Edges in 7-Connected Graphs

โœ Scribed by Su Jian ji; Yuan Xudong

Publisher
Springer Japan
Year
2005
Tongue
English
Weight
164 KB
Volume
21
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Contractible Edges and Triangles in k-Co
Contractible Edges and Triangles in k-Connected Graphs
โœ Ken-ichi Kawarabayashi ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 129 KB

It is proved that if G is a k-connected graph which does not contain K - 4 , then G has an edge e or a triangle T such that the graph obtained from G by connecting e or by contracting T is still k-connected. By using this theorem, we prove some theorems which are generalizations of earlier work. In