Name
Abstract | ||
|---|---|---|
We generalize a minimal 3-connectivity result of Halin from graphs to binary matroids. As applications of this theorem to minimally 3-connected matroids, we obtain new results and short inductive proofs of results of Oxley and Wu. We also give new short inductive proofs of results of Dirac and Halin on minimally k-connected graphs for k ∈ {2,3}. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1017/S0963548301004850 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
3-connectivity result,short inductive proof,new short inductive proof,new result,3-connected matroids,minimally 3-connected binary matroids,minimally k-connected graph | Matroid,Discrete mathematics,Graph,Combinatorics,Mathematical proof,Dirac (video compression format),Graphic matroid,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
10 | 5 | 0963-5483 |
Citations | PageRank | References |
3 | 0.45 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Talmage James Reid | 1 | 48 | 12.18 |
| Haidong Wu | 2 | 15 | 2.63 |