Abstract
We give a complete characterization of the internally 4-connected binary matroids with no minor that is isomorphic to the cycle matroid of the prism+e graph. This characterization generalizes a result first proved by Mayhew and Royle [6] for binary matroids, and generalizes results of Dirac [2] and Lovasz [5] for graphs. Then we use the main result to show that a 3-connected binary matroid with no minor that is isomorphic to the cycle matroid of the prism+e graph is either one of a list of 132 matroids or can be constructed from six specific matroids using the matroid operations of parallel extension and 3-sum. Both MACEK and SAGE Matroid Package are used to assist our computations.
Sign-in/Register to access full text options 
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.
