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

  • B. Courcelle
  • G. Sénizergues
Graph Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1073)


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.


Internal Vertex Minor Inclusion Graph Grammar Respective Type Minor Closure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BC87]
    M. Bauderon and B. Courcelle. Graph expressions and graph rewritings. Mathematical System Theory 20, pages 83–127, 1987.Google Scholar
  2. [Cou90]
    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. [Cou91a]
    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. [Cou91b]
    B. Courcelle. On constructing obstuction sets of words. Bulletin of EATCS 44, pages 178–185, 1991.Google Scholar
  5. [Cou92]
    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. [Cou93]
    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. [FL89]
    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. [Hab93]
    A. Habel. Hyperedge Replacement:Grammars and languages. Lectures Notes in Comput.Sc.,vol. 643, Springer, 1993.Google Scholar
  9. [RS88]
    N. Robertson and P. Seymour. Graph minors xx: Wagner's conjecture. preprint, 1988.Google Scholar
  10. [RST90]
    N. Robertson, P. Seymour, and R. Thomas. Quickly excluding a planar graph, preprint, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • B. Courcelle
    • 1
  • G. Sénizergues
    • 1
  1. 1.LaBRI (URA CNRS 1304) Bordeaux I UniversityTalenceFrance

Personalised recommendations