Polynomial cases of graph decomposition: A complete solution of Holyer s problem

Krzysztof Brys, Zbigniew Lonc. Polynomial cases of graph decomposition: A complete solution of Holyer s problem. Discrete Mathematics, 309(6):1294-1326, 2009. [doi]

@article{BrysL09,
  title = {Polynomial cases of graph decomposition: A complete solution of Holyer s problem},
  author = {Krzysztof Brys and Zbigniew Lonc},
  year = {2009},
  doi = {10.1016/j.disc.2008.01.054},
  url = {http://dx.doi.org/10.1016/j.disc.2008.01.054},
  tags = {completeness, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BrysL09},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {309},
  number = {6},
  pages = {1294-1326},
}