Now showing items 1-2 of 2

    • The Cycling Property for the Clutter of Odd st-Walks 

      Abdi, Ahmad (University of Waterloo, 2014-01-23)
      A binary clutter is cycling if its packing and covering linear program have integral optimal solutions for all Eulerian edge capacities. We prove that the clutter of odd st- walks of a signed graph is cycling if and only ...
    • Representations of even-cycle and even-cut matroids 

      Heo, Cheolwon (University of Waterloo, 2021-08-27)
      In this thesis, two classes of binary matroids will be discussed: even-cycle and even-cut matroids, together with problems which are related to their graphical representations. Even-cycle and even-cut matroids can be ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages