Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"binary clutter"”.

  1. The Cycling Property for the Clutter of Odd st-Walks

    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 if it does not contain as a minor the clutter of odd circuits of K5 nor the …

    waterloo Repository record for The Cycling Property for the Clutter of Odd st-Walks (opens in a new tab)