Abstract
In 1959 Tutte [5] gave a minor characterization of graphic matroids. Within the framework of greedoids, a natural analogue of the cycle matroid in graphs is the branching greedoid. Schmidt has shown that, similar to Tutte's result, branching greedoids can be characterized by forbidden minors. Here we give a simpler proof of this theorem.
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.
