✦ LIBER ✦

Group Connectivity in 3-Edge-Connected Graphs

✍ Scribed by Fan Yang, Xiangwen Li

Book ID: 118783089
Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 154 KB
Volume: 28
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-011-1067-5

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

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

On 3-Edge-Connected Supereulerian Graphs

✍ Hong-Jian Lai; Hao Li; Yehong Shao; Mingquan Zhan 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 222 KB

Flows in 3-edge-connected bidirected gra

Flows in 3-edge-connected bidirected graphs

✍ Erling Wei; Wenliang Tang; Xiaofeng Wang 📂 Article 📅 2011 🏛 Higher Education Press and Springer 🌐 English ⚖ 143 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

Super edge connectivity properties of co

Super edge connectivity properties of connected edge symmetric graphs

✍ Li, Qiaoliang; Li, Qiao 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity Ј(G). We evaluate Ј(G) and the number of i-cutsets C i (G), d Յ i Յ 2d Ϫ 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same s