A Basic Structure for Grids in Surfaces
Combinatorics
2019-01-14 v1
Abstract
A graph embedded in a surface is called an -grid when every facial boundary walk has length four, that is, the topological dual graph of in is 4-regular. Aside from the case where is the torus or Klein bottle, an -grid must have vertices of degrees other than four. Let the sequence of degrees other than four in be called the curvature sequence of . We give a succinct characterization of -grids with nonempty curvature sequence in terms of graphs that have degree sequence and are immersed in a certain way in ; furthermore, the immersion associated with the -grid is unique and so our characterization of -grids also partitions the collection of all -grids.
Cite
@article{arxiv.1901.03682,
title = {A Basic Structure for Grids in Surfaces},
author = {Lowell Abrams and Daniel Slilaty},
journal= {arXiv preprint arXiv:1901.03682},
year = {2019}
}