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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. and Discr. Methods, 8:277–284, 1987.
S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. Technical Report LaBRI-90-02, Universite de Bordeaux, Jan. 1990.
S. Arnborg, A. Proskurowski, and D. Seese. Monadic second order logic, tree automata and forbidden minors. Manuscript, 1990.
M. Bauderon and B. Courcelle. Graph expressions and graph rewritings. Mathematical Systems Theory, 20:83–127, 1987.
J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, 1979.
B. Courcelle. The monadic second order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12–75, March 1990.
M. Fellows and M. Langston. An analogue of the myhill-nerode theorem and its use in computing finite basis characterizations. In IEEE FoCS, pages 520–525, 1989.
N. Robertson and P.D. Seymour. Graph minors XIV, Wagners conjecture. preprint, 1986.
J.W. Thatcher and J.B. Wright. Generalized finite automata theory with an application to a decision problem in second-order logic. Mathematical Systems Theory, 2:57–81, 1968.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lagergren, J., Arnborg, S. (1991). Finding minimal forbidden minors using a finite congruence. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_161
Download citation
DOI: https://doi.org/10.1007/3-540-54233-7_161
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54233-9
Online ISBN: 978-3-540-47516-3
eBook Packages: Springer Book Archive