✦ LIBER ✦

On removable edges in 3-connected cubic graphs

✍ Scribed by Jean-Luc Fouquet; Henri Thuillier

Book ID: 113567523
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 232 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.11.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Cycles through five edges in 3-connected

Cycles through five edges in 3-connected cubic graphs

✍ R. E. L. Aldred; D. A. Holton 📂 Article 📅 1987 🏛 Springer Japan 🌐 English ⚖ 673 KB

Cycles through four edges in 3-connected

Cycles through four edges in 3-connected cubic graphs

✍ R. E. L. Aldred; D. A. Holton; C. Thomassen 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 251 KB

Removable edges of cycles in 5-connected

Removable edges of cycles in 5-connected graphs

✍ Haiyan Kang; Jichang Wu; Guojun Li 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 341 KB

Removable Edges in Longest Cycles of 4-C

Removable Edges in Longest Cycles of 4-Connected Graphs

✍ Jichang Wu; Xueliang Li 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 282 KB