✦ LIBER ✦

The number of contractible edges in 3-connected graphs

✍ Scribed by Katsuhiro Ota

Publisher: Springer Japan
Year: 1988
Tongue: English
Weight: 901 KB
Volume: 4
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01864172

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 in 7-Connected Graphs

✍ Su Jian ji; Yuan Xudong 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 164 KB

Contractible edges in minimally k-connec

Contractible edges in minimally k-connected graphs

✍ Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 420 KB

Distribution of contractible edges in k-

Distribution of contractible edges in k-connected graphs

✍ Nathaniel Dean 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 370 KB

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