𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Longest Cycles in a Class of 3-Connected Graphs

✍ Scribed by CHUANPING CHEN; YONGJIN ZHU

Book ID
119862756
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
462 KB
Volume
576
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A degree sum condition for longest cycle
A degree sum condition for longest cycles in 3-connected graphs
✍ Tomoki Yamashita πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 110 KB πŸ‘ 1 views

## Abstract For a graph __G__, we denote by __d__~__G__~(__x__) and ΞΊ(__G__) the degree of a vertex __x__ in __G__ and the connectivity of __G__, respectively. In this article, we show that if __G__ is a 3‐connected graph of order __n__ such that __d__~__G__~(__x__) + __d__~__G__~(__y__) + __d__~__

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

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