Abstract
We define some new matroids on the edge set of a graph. We show that minimal disconnecting edge sets and minimal edge sets which cover all the odd cycles are cocircuits of a binary matroid. We give a polynomial algorithm for finding a minimum weight circuit in our matroids. A necessary and sufficient condition for an edge set to be the minimum weight odd cycle cover is derived in terms of the family of cut sets of the graph.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
