,
Robert Ganian
,
Phillip Keldenich
,
Maarten Löffler
,
Gert Meijer
,
Alexandra Weinberger
,
Carola Wenk
Creative Commons Attribution 4.0 International license
We define a graph tile to be a unit square (or more generally, a polygon) on which a piece of a graph has been drawn/embedded; in particular, it may have vertices in its interior, edges connecting those vertices, or half-edges that extend to the boundary of the tile. In a graph tiling problem, we are given as input a set of graph tiles, with multiplicities, and the output is an arrangement of those tiles forming a graph of larger area. We focus on a simple tile set: unit square tiles with a central vertex and either a half-edge or no half-edge on each side. Up to symmetry this gives us six different types. We characterize which multiplicities are compatible for sets of at most three different tiles.
@InProceedings{aichholzer_et_al:LIPIcs.GD.2025.51,
author = {Aichholzer, Oswin and Ganian, Robert and Keldenich, Phillip and L\"{o}ffler, Maarten and Meijer, Gert and Weinberger, Alexandra and Wenk, Carola},
title = {{Graph Tiles}},
booktitle = {33rd International Symposium on Graph Drawing and Network Visualization (GD 2025)},
pages = {51:1--51:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-403-1},
ISSN = {1868-8969},
year = {2025},
volume = {357},
editor = {Dujmovi\'{c}, Vida and Montecchiani, Fabrizio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2025.51},
URN = {urn:nbn:de:0030-drops-250371},
doi = {10.4230/LIPIcs.GD.2025.51},
annote = {Keywords: graph tiles}
}