Finding minimal forbidden minors using a finite congruence

This publication has 6 references indexed in Scilit:

• Monadic second order logic, tree automata and forbidden minors
  Published by Springer Nature ,1991
• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
  Information and Computation, 1990
• An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Graph expressions and graph rewritings
  Theory of Computing Systems, 1987
• Complexity of Finding Embeddings in a k-Tree
  SIAM Journal on Algebraic Discrete Methods, 1987
• Generalized finite automata theory with an application to a decision problem of second-order logic
  Theory of Computing Systems, 1968