✦ LIBER ✦

Cycles containing 12 vertices in 3-connected cubic graphs

✍ Scribed by Sheng Bau; Derek Holton

Publisher: John Wiley and Sons
Year: 1991
Tongue: English
Weight: 436 KB
Volume: 15
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190150407

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On the Number of Cycles in 3-Connected C

On the Number of Cycles in 3-Connected Cubic Graphs

✍ R.E.L Aldred; Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Let f (n) be the minimum number of cycles present in a 3-connected cubic graph on n vertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer. 53, 1986) showed that f (n) is subexponential and conjectured that f (n) is superpolynomial. We verify this by showing that, for n sufficie

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

Long Cycles in 3-Connected Graphs

✍ Guantao Chen; Xingxing Yu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Moon and Moser in 1963 conjectured that if G is a 3-connected planar graph on n vertices, then G contains a cycle of length at least Oðn log 3 2 Þ: In this paper, this conjecture is proved. In addition, the same result is proved for 3-connected graphs embeddable in the projective plane, or the torus

A cubic 3-connected graph having no cycl

A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form”

✍ A. K. Kelmans; M. V. Lomonosov 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 55 KB

## Abstract It has been proved [1,2] that in a cubic 3‐connected graph any 9 vertices lie on a common cycle.

Hamiltonian cycles in 3-connected claw-f

Hamiltonian cycles in 3-connected claw-free graphs

✍ MingChu Li 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 437 KB 👁 2 views

Longest cycles in 3-connected graphs con

Longest cycles in 3-connected graphs contain three contractible edges

✍ Nathaniel Dean; Robert L. Hemminger; Katsuhiro Ota 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB 👁 1 views

We show that if G is a 3-connected graph of order at least seven, then every longest path between distinct vertices in G contains at least two contractible edges. An immediate corollary is that longest cycles in such graphs contain at least three contractible edges. We consider only finite undirect