Abstract
We given an effective way to compute the minimal forbidden minors for a minorclosed class of graphs of bounded tree-width from an algorithm that decides a finite congruence that recognizes the class. We prove constructively that every minor closed class of graphs of bounded tree-width that is recognized by a finite congruence has a finite number of minimal forbidden minors. Our proof gives a bound of the size of a minimal forbidden minor. We define explicitly a relation ∼, prove that it is a finite congruence that recognizes the graphs of tree-width at most w, and show how to decide it. Hence, we can find the minimal forbidden minors for graphs of tree-width at most w and bounds on their sizes. An algorithm that recognizes graphs of tree-width at most w in linear time is also obtained.
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.
