✦ LIBER ✦

Longest cycles in r-regular r-connected graphs

✍ Scribed by Brad Jackson; T.D Parsons

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 777 KB
Volume: 32
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90001-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Longest cycles in regular 2-connected cl

Longest cycles in regular 2-connected claw-free graphs

✍ MingChu Li 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 884 KB

In this paper, we show that every 2-connected, k-regular claw-free graph on n vertices contains a cycle of length at least min {4k-2, n} (k >~ 8), and this result is best possible. ## I. Introduction All graphs considered here are undirected and finite, without loops or multiple edges. A graph G is

Intersections of Longest Cycles in k-Con

Intersections of Longest Cycles in k-Connected Graphs

✍ Guantao Chen; Ralph J Faudree; Ronald J Gould 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Let G be a connected graph, where k 2. S. Smith conjectured that every two longest cycles of G have at least k vertices in common. In this note, we show that every two longest cycles meet in at least ck 3Â5 vertices, where cr0.2615. ## 1998 Academic Press In this note, we provide a lower bound on

r-Regular, r-connected decompositions of

r-Regular, r-connected decompositions of complete graphs

✍ H. Fleischner; W. R. Johnstone; A. J. W. Hilton 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

If rjn À 1 and rn is even, then K n can be expressed as the union of t nÀ1 r edgedisjoint isomorphic r-regular r-connected factors.

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.

Hamilton cycles in regular 2-connected g

Hamilton cycles in regular 2-connected graphs

✍ J.A Bondy; M Kouider 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 372 KB