๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

k-connectivity of uniform s-intersection graphs

โœ Scribed by Bloznelis, Mindaugas; Rybarczyk, Katarzyna

Book ID
125510149
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
400 KB
Volume
333
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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