On matroid separations of graphs
暂无分享,去创建一个
Let K be a connected and undirected graph, and M be the polygon matroid of K. Assume that, for some k ⩾ 1, the matroid M is k-separable and k-connected according to the matroid separability and connectivity definitions of W. T. Tutte. In this paper we classify the matroid k-separations of M in terms of subgraphs of K.
[1] William H. Cunningham. On matroid connectivity , 1981, J. Comb. Theory, Ser. B.
[2] W. T. Tutte. Connectivity in Matroids , 1966, Canadian Journal of Mathematics.