The monadic second-order logic of graphs X: Linear orderings
- 10 June 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 160 (1-2) , 87-143
- https://doi.org/10.1016/0304-3975(95)00083-6
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The monadic second-order logic of graphs VIII: OrientationsAnnals of Pure and Applied Logic, 1995
- 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
- Asynchronous Mappings and Asynchronous Cellular AutomataInformation and Computation, 1993
- The monadic second-order logic of graphs VII: graphs as relational structuresTheoretical Computer Science, 1992
- The monadic second-order logic of graphs V: on closing the gap between definability and recognizabilityTheoretical Computer Science, 1991
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Theory of tracesTheoretical Computer Science, 1988
- An axiomatic definition of context-free rewriting and its application to NLC graph grammarsTheoretical Computer Science, 1987
- Complement reducible graphsDiscrete Applied Mathematics, 1981