Now showing items 1-1 of 1
The Cycling Property for the Clutter of Odd st-Walks
(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 ...