INTERSECTIONS OF LONGEST CYCLES IN K-CONNECTED GRAPHS

Authors
CHEN GT FAUDREE RJ GOULD RJ
Citation
Gt. Chen et al., INTERSECTIONS OF LONGEST CYCLES IN K-CONNECTED GRAPHS, J COMB TH B, 72(1), 1998, pp. 143-149
Citations number
10
Categorie Soggetti
Mathematics,Mathematics
Journal title
JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN journal
00958956 → ACNP
Volume
72
Issue
1
Year of publication
1998
Pages
143 - 149
Database
ISI
SICI code
0095-8956(1998)72:1<143:IOLCIK>2.0.ZU;2-V
Abstract
Let G be a connected graph. where k greater than or equal to 2. S. Smi th conjectured that every two longest cycles of G have at least k vert ices in common. In this note, we show that every two longest cycles me et in at least ck(3/5) vertices, where c approximate to 0.2615. (C) 19 98 Academic Press.