An algebraic theory of graph reduction

This publication has 19 references indexed in Scilit:

• Forbidden minors characterization of partial 3-trees
  Discrete Mathematics, 1990
• Linear time algorithms for NP-hard problems restricted to partial k-trees
  Discrete Applied Mathematics, 1989
• Graph expressions and graph rewritings
  Theory of Computing Systems, 1987
• Linear-time computation of optimal subgraphs of decomposable graphs
  Journal of Algorithms, 1987
• Characterization of partial 3-trees in terms of three structures
  Graphs and Combinatorics, 1986
• Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
  Theoretical Computer Science, 1986
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
  BIT Numerical Mathematics, 1985
• Steiner trees, partial 2–trees, and minimum IFI networks
  Networks, 1983
• Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs
  Journal of the ACM, 1979
• Generalized finite automata theory with an application to a decision problem of second-order logic
  Theory of Computing Systems, 1968