✦ LIBER ✦

On Cycles in 3-Connected Graphs

✍ Scribed by Hao Li

Publisher: Springer Japan
Year: 2000
Tongue: English
Weight: 156 KB
Volume: 16
Category: Article
ISSN: 0911-0119
DOI: 10.1007/pl00007224

No coin nor oath required. For personal study only.

📜 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

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

Dominating cycles in regular 3-connected

Dominating cycles in regular 3-connected graphs

✍ Bill Jackson; Hao Li; Yongjin Zhu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 744 KB

Jackson, B., H. Li and Y. Zhu, Dominating cycles in regular 3-connected graphs, Discrete Mathematics 102 (1992) 163-176. Let G be a 3-connected, k-regular graph on at most 4k vertices. We show that, for k > 63, every longest cycle of G is a dominating cycle. We conjecture that G is in fact hamilton

Hamilton cycles in regular 3-connected g

Hamilton cycles in regular 3-connected graphs

✍ Yongjin Zhu; Hao Li 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 993 KB

We show in this paper that for k Z-63, every 3-connected, k-regular simple graph on at most yk vertices is hamiltonian.

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

Long cycles in 3-connected graphs in ori

Long cycles in 3-connected graphs in orientable surfaces

✍ Laura Sheppardson; Xingxing Yu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

## Abstract In this article, we apply a cutting theorem of Thomassen to show that there is a function __f__: N → N such that if __G__ is a 3‐connected graph on __n__ vertices which can be embedded in the orientable surface of genus __g__ with face‐width at least __f__(__g__), then __G__ contains a