Cutting and partitioning a graph after a fixed pattern

This publication has 10 references indexed in Scilit:

• The NP-completeness column: An ongoing guide
  Journal of Algorithms, 1982
• The complexity of restricted spanning tree problems
  Journal of the ACM, 1982
• How to assemble tree machines (Extended Abstract)
  Published by Association for Computing Machinery (ACM) ,1982
• A layout strategy for VLSI which is provably good (Extended Abstract)
  Published by Association for Computing Machinery (ACM) ,1982
• Applications of a Planar Separator Theorem
  SIAM Journal on Computing, 1980
• The directed subgraph homeomorphism problem
  Theoretical Computer Science, 1980
• A Separator Theorem for Planar Graphs
  SIAM Journal on Applied Mathematics, 1979
• Node-and edge-deletion NP-complete problems
  Published by Association for Computing Machinery (ACM) ,1978
• The complexity of comparability graph recognition and coloring
  Computing, 1977
• A Decomposition Theorem for Partially Ordered Sets
  Annals of Mathematics, 1950