Embedding cycles and paths on solid grid graphs


Despite many algorithms for embedding graphs on unbounded grids, only a few results on embedding graphs on restricted grids have been published. In this paper, we study the problem of embedding paths and cycles on solid grid graphs. We show that a cycle of length k is unit-length embeddable on a solid grid graph G if k is an even integer between four and… (More)
DOI: 10.1007/s11227-016-1811-y


8 Figures and Tables