Title of article
On deletions of largest bonds in graphs Original Research Article
Author/Authors
Nolan McMurray، نويسنده , , Talmage James Reid، نويسنده , , Laura Sheppardson، نويسنده , , Bing Wei، نويسنده , , Bing Wei and Haidong Wu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
5
From page
1137
To page
1141
Abstract
A well-known conjecture of Scott Smith is that any two distinct longest cycles of a k-connected graph must meet in at least k vertices when image. We provide a dual version of this conjecture for two distinct largest bonds in a graph. This dual conjecture is established for image.
Keywords
Bond , Cocircuit , Cycle intersection
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947426
Link To Document