𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Intersection of Longest Paths in a Graph

✍ Scribed by Susanna F. de Rezende; Cristina G. Fernandes; Daniel M. Martin; Yoshiko Wakabayashi

Book ID
119236641
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
187 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Intersections of longest cycles in grid
Intersections of longest cycles in grid graphs
✍ Menke, B.; Zamfirescu, T.; Zamfirescu, C. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 292 KB πŸ‘ 3 views

It is well-known that the largest cycles of a graph may have empty intersection. This is the case, for example, for any hypohamiltonian graph. In the literature, several important classes of graphs have been shown to contain examples with the above property. This paper investigates a (nontrivial) cl

The longest path in a random graph
The longest path in a random graph
✍ MiklΓ³s Ajtai; JΓ‘nos KomlΓ³s; Endre SzemerΓ©di πŸ“‚ Article πŸ“… 1981 πŸ› Springer-Verlag 🌐 English βš– 571 KB
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