论文信息 - The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed

The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed

We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique solution.

Bruno Courcelle | Géraud Sénizergues | B. Courcelle | Géraud Sénizergues

[1] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability , 1991, Theor. Comput. Sci..

[2] Robin Thomas,et al. Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.

[3] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[4] Bruno Courcelle,et al. On Constructing Obstruction Sets of Words , 1991, Bull. EATCS.

[5] Annegret Habel,et al. Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.

[6] Bruno Courcelle,et al. The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues , 1992, RAIRO Theor. Informatics Appl..

[7] Michael R. Fellows,et al. An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8] Bruno Courcelle,et al. Graph grammars, monadic second-order logic and the theory of graph minors , 1991, Graph Structure Theory.