Bounds and complexity for the tessellation problem

DOI10.21711/231766362017/rmc453MaRDI QIDQ6489469

Luís Cunha, Celina M. Herrera de Figueiredo, Alexandre Abreu, Daniel F. D. Posner, Renato Portugal, Franklin Marquezino, Luis Anotnio Brasil Kowada, Tharso D. Fernandes

Publication date: 22 April 2024

Published in: Matemática Contemporânea (Search for Journal in Brave)

zbMATH Keywords

tessellationclique graphNP-completestaggered quantum walk

Mathematics Subject Classification ID

Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Bounds and complexity for the tessellation problem