Abstract
A minimax theorem is proved. The theorem concerns packing non-separating circuits in eulerian graphs embedded in the projective plane. The proof includes a polynomial algorithm which produces a collection of edge-disjoint, non-separating circuits of the same cardinality as a transversal of such circuits.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
