Embedding grid graphs on surfaces

From MaRDI portal
Publication:2127724

DOI10.1007/S00373-022-02488-WzbMATH Open1486.05203arXiv2104.12270OpenAlexW3158732798MaRDI QIDQ2127724FDOQ2127724


Authors: Christian Millichap, Fabian Salinas Edit this on Wikidata


Publication date: 21 April 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of a grid graph's combinatorics. As an application, we provide a complete classification of planar and toroidal grid graphs. Our work requires a variety of combinatorial arguments to determine effective lower bounds on the genus of a grid graph, along with explicitly constructing embeddings of grid graphs on surfaces to determine effective upper bounds on their genera.


Full work available at URL: https://arxiv.org/abs/2104.12270




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Embedding grid graphs on surfaces

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