Abstract
N.Robertson and P.D.Seymour proved that each minor closed class K of graphs is characterized by finitely many minimal forbidden minors. If these minors are given then they can be used to find an efficient membership test for such classes (see [Rob Sey 86b]). From these minors one can get a monadic second order description of the class K. Main result of the article is that from a monadic second order description of the class K. Main result of the article is that from a monadic second order description of K the minimal forbidden minors can be constructed, when K contains only graphs of universally bounded tree width. The result is applied to the class of partial 2-pathes.KeywordsBinary TreeOrder LogicTree DecompositionOrder PropertyLower IdealThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
