Author:
Hliněný Petr,Seese Detlef
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Arnborg, S., Lagergren, J., Seese, D.: Easy Problems for Tree-Decomposable Graphs. Journal of Algorithms 12, 308–340 (1991)
2. Courcelle, B.: The decidability of the monadic second order theory of certain sets of finite and infinite graphs. In: Logic in Computer Science, LICS 1988, Edinburg (1988)
3. Courcelle, B.: The Monadic Second-Order Logic of Graphs I. Recognizable sets of Finite Graphs. Information and Computation 85, 12–75 (1990)
4. Courcelle, B.: The monadic second order logic of graphs VI: on several representations of graphs by relational structures. Discrete Appl. Math. 54, 117–149 (1994); Erratum 63, 199–200 (1995)
5. Courcelle, B.: The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantification. Theoretical Computer Science 299, 1–36 (2003)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献