✦ LIBER ✦

Cycles through edges in cyclically k–connected cubic graphs

✍ Scribed by William McCuaig

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 247 KB
Volume: 103
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90043-f

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Cycles through k+2 vertices in k-connect

Cycles through k+2 vertices in k-connected graphs

✍ N. Tsikopoulos 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 73 KB

Cycles passing through k + 1 vertices in

Cycles passing through k + 1 vertices in k-connected graphs

✍ Jun Fujisawa; Tomoki Yamashita 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract In this article, we prove the following theorem. Let __k__ ≥ 3 be an integer, __G__ be a __k__‐connected graph with minimum degree __d__ and __X__ be a set of __k__ + 1 vertices on a cycle. Then __G__ has a cycle of length at least min {2d,|V(G)|} passing through __X__. This result give

Nonseparating cycles in K-Connected grap

Nonseparating cycles in K-Connected graphs

✍ Carsten Thomassen 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB 👁 1 views

## Abstract We show that every __k__‐connected graph with no 3‐cycle contains an edge whose contraction results in a __k__‐connected graph and use this to prove that every (__k__ + 3)‐connected graph contains a cycle whose deletion results in a __k__‐connected graph. This settles a problem of L. Lo

Cycles and paths through specified verti

Cycles and paths through specified vertices in k-connected graphs

✍ Y Egawa; R Glas; S.C Locke 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 693 KB

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.

Spanning Cycles Through Specified Edges

Spanning Cycles Through Specified Edges in Bipartite Graphs

✍ Reza Zamani; Douglas B. West 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

P ósa proved that if G is an n-vertex graph in which any two nonadjacent vertices have degree-sum at least n+k, then G has a spanning cycle containing any specified family of disjoint paths with a total of k edges. We consider the analogous problem for a bipartite graph G with n vertices and parts o