Now showing items 1-2 of 2

    • 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, ...
    • Aspects of Matroid Connectivity 

      Brettell, Nicholas John (University of Canterbury. School of Mathematics and Statistics, 2014)
      Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in the eventual solution of many problems in matroid theory. Loosely speaking, connectivity can be used to help describe a ...