The monadic second order logic of graphs VI: on several representations of graphs by relational structures
- 17 October 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 54 (2-3) , 117-149
- https://doi.org/10.1016/0166-218x(94)90019-1
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Some Combinatorial Aspects of Time-stamp SystemsEuropean Journal of Combinatorics, 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
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Forbidden minors characterization of partial 3-treesDiscrete Mathematics, 1990
- An axiomatic definition of context-free rewriting and its application to NLC graph grammarsTheoretical Computer Science, 1987
- Graph expressions and graph rewritingsTheory of Computing Systems, 1987
- Homomorphieeigenschaften und mittlere Kantendichte von GraphenMathematische Annalen, 1967
- Beweis einer Abschwächung der Hadwiger-VermutungMathematische Annalen, 1964
- Decomposition of Finite Graphs Into ForestsJournal of the London Mathematical Society, 1964