Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond. Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. In Jianer Chen, Fedor V. Fomin, editors, Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers. Volume 5917 of Lecture Notes in Computer Science, pages 149-160, Springer, 2009. [doi]

@inproceedings{FellowsHR09,
  title = {Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs},
  author = {Michael R. Fellows and Danny Hermelin and Frances A. Rosamond},
  year = {2009},
  doi = {10.1007/978-3-642-11269-0_12},
  url = {http://dx.doi.org/10.1007/978-3-642-11269-0_12},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/FellowsHR09},
  cites = {0},
  citedby = {0},
  pages = {149-160},
  booktitle = {Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers},
  editor = {Jianer Chen and Fedor V. Fomin},
  volume = {5917},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-11268-3},
}