✦ LIBER ✦

Cycles through five edges in 3-connected cubic graphs

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

Publisher: Springer Japan
Year: 1987
Tongue: English
Weight: 673 KB
Volume: 3
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788553

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

Cycles Through 23 Vertices in 3-Connecte

Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs

✍ 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

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.

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

Long Cycles Passing Through a Specified

Long Cycles Passing Through a Specified Edge in 3-Connected Graphs

✍ Zhiren Sun; Feng Tian; Bing Wei 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 157 KB

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