A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder
Document Type
Article
Publication Date
10-1-2023
Abstract
Let G be a graph such that, whenever two vertices x and y of G are joined by three internally disjoint paths, x and y are adjacent. Jamison and Mulder determined that the set of such graphs coincides with the set of graphs that can be built from cycles and complete graphs via 1-sums and parallel connections. This paper proves an analogous result for binary matroids.
Publication Source (Journal or Book title)
Advances in Applied Mathematics
Recommended Citation
Crenshaw, C., & Oxley, J. (2023). A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder. Advances in Applied Mathematics, 151 https://doi.org/10.1016/j.aam.2023.102577
COinS