The monadic second-order logic of graphs VIII: Orientations
- 1 March 1995
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 72 (2) , 103-143
- https://doi.org/10.1016/0168-0072(95)94698-v
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- The monadic second order logic of graphs VI: on several representations of graphs by relational structuresDiscrete Applied Mathematics, 1994
- Monadic second-order definable graph transductions: a surveyTheoretical Computer Science, 1994
- The monadic second-order logic of graphs VII: graphs as relational structuresTheoretical Computer Science, 1992
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issuesRAIRO - Theoretical Informatics and Applications, 1992
- The monadic second-order logic of graphs V: on closing the gap between definability and recognizabilityTheoretical Computer Science, 1991
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Reachability is harder for directed than for undirected finite graphsThe Journal of Symbolic Logic, 1990
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Graph expressions and graph rewritingsTheory of Computing Systems, 1987
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960