✦ LIBER ✦

Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs

✍ Scribed by R. E. L. Aldred; S. Bau; D. A. Holton; Brendan D. McKay

Publisher: Springer Japan
Year: 1999
Tongue: English
Weight: 58 KB
Volume: 15
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730050046

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles containing 12 vertices in 3-conne

Cycles containing 12 vertices in 3-connected cubic graphs

✍ 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

Cycles through three vertices in 2-connected graphs

✍ S. C. Locke; Cun-Quan Zhang 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 331 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

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

The smallest non-hamiltonian 3-connected

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices

✍ D.A Holton; B.D McKay 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 604 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