Title of article
Pairs of largest circuits in 3-connected matroids Original Research Article
Author/Authors
S. R. Kingan and Manoel Lemos، نويسنده , , Talmage James Reid، نويسنده , , Bryan Williams، نويسنده , , Bing Wei and Haidong Wu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
4
From page
313
To page
316
Abstract
Smith conjectured that two distinct longest cycles of a k-connected graph meet in at least k vertices when kgreater-or-equal, slanted2. We prove an extension of this conjecture for 3-connected matroids.
Keywords
Circuit , Circumference , matroid
Journal title
Linear Algebra and its Applications
Serial Year
2007
Journal title
Linear Algebra and its Applications
Record number
825766
Link To Document