Bounds and complexity for the tessellation problem

DOI10.21711/231766362017/RMC453MaRDI QIDQ6489469zbMATH OpenFDO

Authors Alexandre Abreu, Luís Felipe Ignácio Cunha, T. D. Fernandes, Celina M. H. de Figueiredo, L. A. B. Kowada, Franklin Marquezino, Daniel F. D. Posner, R. Portugal

Publication date 22 April 2024

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

Full work available at URL https://doi.org/10.21711/231766362017/RMC453

zbMATH Keywords

clique graphNP-completestaggered quantum walktessellation

Mathematics Subject Classification ID

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

Recommendations

• The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
• The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
• Total tessellation cover: bounds, hardness, and applications
• A computational complexity comparative study of graph tessellation problems
• 有限偶圈图上的 2-嵌入交错量子游荡

Cited in

(1)

• \textsc{Tessellability} and \textsc{tessellability completion} of graphs with few \(P_4\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489469)