On deletions of largest bonds in graphs |
| |
| Authors: | Nolan McMurray Laura Sheppardson Haidong Wu |
| |
| Institution: | a Department of Mathematics, Texas State University - San Marcos, TX 78666, USA
b Department of Mathematics, The University of Mississippi, University, MS 38677, USA |
| |
| 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 k≥2. We provide a dual version of this conjecture for two distinct largest bonds in a graph. This dual conjecture is established for k?6. |
| |
| Keywords: | Bond Cocircuit Cycle intersection |
| 本文献已被 ScienceDirect 等数据库收录！ |
