Name
Abstract | ||
|---|---|---|
If M is a loopless matroid in which M / vbX and M / vbY are connected and X ∩ Y is non-empty, then one easily shows that M / vb ( X ∪ Y ) is connected. Likewise, it is straightforward to show that if G and H are n - connected graphs having at least n common vertices, then G ∪ H is n -connected. The purpose of this note is to prove a matroid connectivity result that is a common generalization of these two observations. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1016/0012-365X(94)00179-2 | Discrete Mathematics |
Keywords | Field | DocType |
matroid connectivity | Matroid,Topology,Combinatorics,Matroid partitioning,Graphic matroid,Mathematics | Journal |
Volume | Issue | ISSN |
146 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
20 | 2.06 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| James Oxley | 1 | 397 | 57.57 |
| Haidong Wu | 2 | 50 | 5.27 |