✦ LIBER ✦

Cycles through ten vertices in 3-connected cubic graphs

✍ Scribed by M. N. Ellingham; D. A. Holton; C. H. C. Little

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles Through 23 Vertices in 3-Connecte

✍ R. E. L. Aldred; S. Bau; D. A. Holton; Brendan D. McKay 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 58 KB

Cycles containing 12 vertices in 3-conne

✍ Sheng Bau; Derek Holton 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB

## Abstract A necessary and sufficient condition is obtained for a set of 12 vertices in any 3‐connected cubic graph to lie on a common cycle.

Cycles through three vertices in 2-conne

✍ S. C. Locke; Cun-Quan Zhang 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 331 KB

Cycles through five edges in 3-connected

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

Cycles through four edges in 3-connected

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

Cycles through k+2 vertices in k-connect

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