Now showing items 1-1 of 1

    • An algorithm for constructing a k-tree for a k-connected matroid 

      Brettell, N.; Semple, C. (University of Canterbury. Mathematics and Statistics, 2015)
      For a k-connected matroid M, Clark and Whittle showed there is a tree that displays, up to a natural equivalence, all non-trivial k-separations of M. In this paper, we present an algorithm for con- structing such a tree, ...