The nonexistence of reduction rules giving an embedding into a k-tree

This publication has 8 references indexed in Scilit:

• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
  Information and Computation, 1990
• Linear time algorithms for NP-hard problems restricted to partial k-trees
  Discrete Applied Mathematics, 1989
• Linear-time computation of optimal subgraphs of decomposable graphs
  Journal of Algorithms, 1987
• Complexity of Finding Embeddings in a k-Tree
  SIAM Journal on Algebraic Discrete Methods, 1987
• Characterization of partial 3-trees in terms of three structures
  Graphs and Combinatorics, 1986
• Graph minors. II. Algorithmic aspects of tree-width
  Journal of Algorithms, 1986
• Characterization and Recognition of Partial 3-Trees
  SIAM Journal on Algebraic Discrete Methods, 1986
• On simple characterizations of k-trees
  Discrete Mathematics, 1974