Intersections of longest cycles in \(k\)-connected graphs
type: Item
instance of: scholarly article
title: Intersections of longest cycles in \(k\)-connected graphs
zbMATH Open document ID: 0897.05056
author: Guantao Chen
author: Ronald Gould
author: Ralph Faudree
published in: Journal of Combinatorial Theory. Series B
publication date: 1998-10-19T00:00:00Z
review text: Let \(G\) be a connected graph, where \(k\geq 2\). S. Smith conjectured that every two longest cycles of \(G\) have at least \(k\) vertices in common. We show that every two longest cycles meet in at least \(ck^{3/5}\) vertices, where \(c\approx 0.2615\).
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1154567
zbMATH Keywords: connected graph
zbMATH Keywords: longest cycles
reviewed by: Guanggan Chen
MaRDI profile type: Publication
full work available at URL: jctb.1997.1802
OpenAlex ID: W2064766945
cites work: Long cycles in vertex-transitive graphs
cites work: Q4871748
cites work: Q5422499
cites work: Some Theorems on Abstract Graphs
cites work: Q5759552
cites work: Q3342610
cites work: A polynomial algorithm for the max-cut problem on graphs without long odd cycles
cites work: Q3257129
cites work: Eine Eigenschaft der Atome endlicher Graphen
cites work: Connectivity of transitive graphs
DOI: 10.1006/JCTB.1997.1802
description: scientific article; zbMATH DE number 1154567