Name
Abstract | ||
|---|---|---|
We extend to matroids Smith's Conjecture that any two distinct longest cycles of a k-connected graph meet in at least k vertices when k=2. We generalize several known results for graphs and matroids by proving the matroid conjecture in the case that k=2. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.aam.2004.09.002 | Advances in Applied Mathematics |
Keywords | Field | DocType |
known result,k-connected graph,k vertex,largest circuit,matroids smith,matroid conjecture,distinct longest cycle,connected graph | Matroid,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Matroid partitioning,Graphic matroid,Connectivity,Conjecture,Mathematics,Branch-decomposition | Journal |
Volume | Issue | ISSN |
34 | 1 | 0196-8858 |
Citations | PageRank | References |
3 | 0.63 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nolan Mcmurray | 1 | 5 | 1.07 |
| Talmage James Reid | 2 | 48 | 12.18 |
| Bing Wei | 3 | 3 | 0.63 |
| Haidong Wu | 4 | 26 | 8.43 |