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

An Extremal Problem on Contractible Edges in 3-Connected Graphs

โœ Scribed by Joe Anderson; Haidong Wu

Book ID
106047606
Publisher
Springer Japan
Year
2006
Tongue
English
Weight
125 KB
Volume
22
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

Longest cycles in 3-connected graphs con
Longest cycles in 3-connected graphs contain three contractible edges
โœ Nathaniel Dean; Robert L. Hemminger; Katsuhiro Ota ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 221 KB ๐Ÿ‘ 1 views

We show that if G is a 3-connected graph of order at least seven, then every longest path between distinct vertices in G contains at least two contractible edges. An immediate corollary is that longest cycles in such graphs contain at least three contractible edges. We consider only finite undirect