✦ LIBER ✦

Uniform cyclic edge connectivity in cubic graphs

✍ Scribed by R. E. L. Aldred; D. A. Holton; Bill Jackson

Publisher: Springer-Verlag
Year: 1991
Tongue: English
Weight: 672 KB
Volume: 11
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01206354

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles through edges in cyclically k–con

Cycles through edges in cyclically k–connected cubic graphs

✍ William McCuaig 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 247 KB

McCuaig, W., Cycles through edges in cyclically k-connected cubic graphs

Cyclically 5-edge-connected cubic planar

Cyclically 5-edge-connected cubic planar graphs and shortness coefficients

✍ P. J. Owens 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

## Abstract It is shown that some classes of cyclically 5‐edge‐connected cubic planar graphs with only one type of face besides pentagons contain non‐Hamiltonian members and have shortness coefficients less than unity.

Super cyclically edge connected transiti

Super cyclically edge connected transitive graphs

✍ Zhao Zhang; Bing Wang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 494 KB

Enumeration of cyclically 4-connected cu

Enumeration of cyclically 4-connected cubic graphs

✍ Nicholas C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 550 KB

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

Edge-connectivity in p-partite graphs

✍ Lutz Volkmann 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

Let G = (V, €1 be a finite, simple p-partite graph with minimum degree 6 and edge-connectivity A. It is proved that if IVI d (2pS)/(p -1) -2 or in special cases that if IVI I ( 2 p 6 ) / ( p -1) -1, then A = S . It is further shown that this result is best possible.