Abstract
Even-cycle matroids are elementary lifts of graphic matroids. Even-cut matroids are elementary lifts of cographic matroids. We give a polynomial time algorithm to check if a binary matroid is an even-cycle matroid. We also give a polynomial time algorithm to check if a binary matroid is an even-cut matroid. These algorithms rely on structural properties of the class of pinch-graphic matroids.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.