Name
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= |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.03.065 | Discrete Mathematics |
Keywords | Field | DocType |
bond,cycle intersection,cocircuit,connected graph | Discrete mathematics,Wheel graph,Combinatorics,Coxeter graph,Graph factorization,Cubic graph,Cycle graph,Distance-regular graph,Graph minor,Symmetric graph,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 7 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.44 | 2 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nolan Mcmurray | 1 | 5 | 1.07 |
| Talmage James Reid | 2 | 48 | 12.18 |
| Laura Sheppardson | 3 | 11 | 2.06 |
| Bing Wei | 4 | 2 | 0.44 |
| Haidong Wu | 5 | 26 | 8.43 |