A computational complexity comparative study of graph tessellation problems

Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner. A computational complexity comparative study of graph tessellation problems. Theoretical Computer Science, 858:81-89, 2021. [doi]

@article{AbreuCFKMPP21,
  title = {A computational complexity comparative study of graph tessellation problems},
  author = {Alexandre Santiago de Abreu and Luís Felipe I. Cunha and Celina M. H. de Figueiredo and Luis Antonio Brasil Kowada and Franklin L. Marquezino and Renato Portugal and Daniel Posner},
  year = {2021},
  doi = {10.1016/j.tcs.2020.11.045},
  url = {https://doi.org/10.1016/j.tcs.2020.11.045},
  researchr = {https://researchr.org/publication/AbreuCFKMPP21},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {858},
  pages = {81-89},
}