Skip to main content
SpringerLink
Log in

The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed

  • Graph Languages
  • Conference paper
  • First Online:
Book cover Graph Grammars and Their Application to Computer Science (Graph Grammars 1994)

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

  • 154 Accesses

Abstract

We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique solution.

This work has been supported by the ESPRIT Basic Research Working Group COMPUGRAPH II

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bauderon and B. Courcelle. Graph expressions and graph rewritings. Mathematical System Theory 20, pages 83–127, 1987.

    Google Scholar 

  2. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, pages 12–75, 1990.

    Google Scholar 

  3. B. Courcelle. The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theoretical Computer Science 80, pages 153–202, 1991.

    Google Scholar 

  4. B. Courcelle. On constructing obstuction sets of words. Bulletin of EATCS 44, pages 178–185, 1991.

    Google Scholar 

  5. B. Courcelle. The monadic second-order logic of graphs III:Tree-decompositions, minors and complexity issues. RAIRO Informatique Théorique et Applications 26, pages 257–286, 1992.

    Google Scholar 

  6. B. Courcelle. Graph grammars, monadic second-order logic and the theory of graph minors. in N.Robertson and P.Seymour eds., Contemporary Mathematics 147, American Mathematical Society, pages 565–590, 1993.

    Google Scholar 

  7. M. Fellows and M. Langston. An analogue of the Myhill-Nerode theorem and its use in computing finite basis characterizations. Proceedings 30th Symp. FOCS, pages 520–525, 1989.

    Google Scholar 

  8. A. Habel. Hyperedge Replacement:Grammars and languages. Lectures Notes in Comput.Sc.,vol. 643, Springer, 1993.

    Google Scholar 

  9. N. Robertson and P. Seymour. Graph minors xx: Wagner's conjecture. preprint, 1988.

    Google Scholar 

  10. N. Robertson, P. Seymour, and R. Thomas. Quickly excluding a planar graph, preprint, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI (URA CNRS 1304) Bordeaux I University, 351 Cours de la Libération, 33405, Talence, France

    B. Courcelle & G. Sénizergues

Authors
  1. B. Courcelle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Sénizergues
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Janice Cuny Hartmut Ehrig Gregor Engels Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Courcelle, B., Sénizergues, G. (1996). The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_98

Download citation

  • DOI: https://doi.org/10.1007/3-540-61228-9_98

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61228-5

  • Online ISBN: 978-3-540-68388-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation