Skip to main content
SpringerLink
Log in

The logical expression of graph properties

  • Conference paper
  • First Online:
Graph Grammars and Their Application to Computer Science (Graph Grammars 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 532))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. ARNBORG S., LAGERGREN J., SEESE D., Problems easy for tree-decomposable graphs,ICALP 1988, L N C S 317,pp.38–51.

    Google Scholar 

  2. BAUDERON M., Infinite hypergraphs, Theor. Comput. Sci., to appear.(Extended abstract in this volume).

    Google Scholar 

  3. COURCELLE B., An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoretical Computer Science 55 (1987) 141–181.

    Article  Google Scholar 

  4. 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

    Google Scholar 

  5. COURCELLE B., The monadic second-order logic of graphs I, recognizable sets of finite graphs. Information and Computation 85 (1990) 12–75.

    Article  Google Scholar 

  6. COURCELLE B., The monadic second-order logic of graphs II, Infinite graphs of bounded width, Mathematical Systems Theory, 21(1989)187–221.

    Article  Google Scholar 

  7. COURCELLE B., The monadic second-order logic of graphs IV, Definability properties of equational graphs, Annals Pure Applied Logic 49(1990)193–255.

    Article  Google Scholar 

  8. 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).

    Google Scholar 

  9. COURCELLE B., Graphs as relational structures: an algebraic and logical approach, this volume.

    Google Scholar 

  10. IMMERMAN N., Languages that capture complexity classes, SIAM J.Comput. 16(1987)760–777.

    Article  Google Scholar 

  11. KANNELLAKIS P., Elements of relational database theory, same volume as [4], pp.1073–1156.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique, Université Bordeaux-I, 351, Cours de la Libération, 33405, Talence - Cedex, France

    Bruno Courcelle

Authors
  1. Bruno Courcelle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Hans-Jörg Kreowski Grzegorz Rozenberg

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation