References
ARNBORG S., LAGERGREN J., SEESE D., Problems easy for tree-decomposable graphs,ICALP 1988, L N C S 317,pp.38–51.
BAUDERON M., Infinite hypergraphs, Theor. Comput. Sci., to appear.(Extended abstract in this volume).
COURCELLE B., An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoretical Computer Science 55 (1987) 141–181.
COURCELLE B., Graph rewriting: An algebraic and logic approach, in "Handbook of Theoretical Computer.Science Volume B", J. Van Leeuwen ed., Elsevier,1990, pp.193–242
COURCELLE B., The monadic second-order logic of graphs I, recognizable sets of finite graphs. Information and Computation 85 (1990) 12–75.
COURCELLE B., The monadic second-order logic of graphs II, Infinite graphs of bounded width, Mathematical Systems Theory, 21(1989)187–221.
COURCELLE B., The monadic second-order logic of graphs IV, Definability properties of equational graphs, Annals Pure Applied Logic 49(1990)193–255.
COURCELLE B., The monadic second order logic of graphs VI: On several representations of graphs by relational structures, Report 89-99, (see also Logic in Computer Science 1990, Philadelphia).
COURCELLE B., Graphs as relational structures: an algebraic and logical approach, this volume.
IMMERMAN N., Languages that capture complexity classes, SIAM J.Comput. 16(1987)760–777.
KANNELLAKIS P., Elements of relational database theory, same volume as [4], pp.1073–1156.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B. (1991). The logical expression of graph properties. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017376
Download citation
DOI: https://doi.org/10.1007/BFb0017376
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54478-4
Online ISBN: 978-3-540-38395-6
eBook Packages: Springer Book Archive