论文信息 - Recognizable Sets of Graphs of Bounded Tree-Width

Recognizable Sets of Graphs of Bounded Tree-Width

We establish that a set of finite graphs of tree-width at most k is recognizable (with respect to the algebra of graphs with an unbounded number of sources) if and only if it is recognizable with respect to the algebra of graphs with at most k sources. We obtain a somewhat stronger result for sets of simple finite graphs of tree-width at most k.

Bruno Courcelle | Jens Lagergren | B. Courcelle | J. Lagergren

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

[2] Bruno Courcelle,et al. An algebraic theory of graph reduction , 1993, JACM.

[3] Michael R. Fellows,et al. Finite automata, bounded treewidth, and well-quasiordering , 1991, Graph Structure Theory.

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

[5] Annegret Habel,et al. A Comparison of Compatible, Finite, and Inductive Graph Properties , 1993, Theor. Comput. Sci..

[6] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[7] Paul Seymour,et al. Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle, USA , 1993, Graph Structure Theory.

[8] Annegret Habel,et al. Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement , 1991, Theor. Comput. Sci..

[9] Bruno Courcelle,et al. Recognizable sets of graphs: equivalent definitions and closure properties , 1994, Mathematical Structures in Computer Science.

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