The challenges of unbounded treewidth in parameterised subgraph counting problems

Kitty Meeks. The challenges of unbounded treewidth in parameterised subgraph counting problems. Discrete Applied Mathematics, 198:170-194, 2016. [doi]

@article{Meeks16,
  title = {The challenges of unbounded treewidth in parameterised subgraph counting problems},
  author = {Kitty Meeks},
  year = {2016},
  doi = {10.1016/j.dam.2015.06.019},
  url = {http://dx.doi.org/10.1016/j.dam.2015.06.019},
  researchr = {https://researchr.org/publication/Meeks16},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {198},
  pages = {170-194},
}