Related papers: Generating maps on surfaces

The $2$-cell embeddings of graphs on closed surfaces have been widely studied. It is well known that ($2$-cell) embedding a given graph $G$ on a closed orientable surface is equivalent to cyclically ordering the edges incident to each…

We construct three sequences of regular surfaces of general type with unbounded numerical invariants whose canonical map is 2-to-1 onto a canonically embedded surface. Only sporadic examples of surfaces with these properties were previously…

How can we visualize all the surfaces that can be made from the faces of the tesseract? In recent work, Aveni, Govc, and Rold\'an showed that the torus and the sphere are the only closed surfaces that can be realized by a subset of…

We show how, given a sufficiently large point cloud sampled from an embedded 2-manifold in $\mathbb{R}^n$, we may obtain a global representation as a cell complex with vertices given by a representative subset of the point cloud. The vertex…

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

Whitney's theorem states that every 3-connected planar graph is uniquely embeddable on the sphere. On the other hand, it has many inequivalent embeddings on another surface. We shall characterize structures of a $3$-connected $3$-regular…

There are several different extensions of the Tutte polynomial to graphs embedded in surfaces. To help frame the different options, here we consider the problem of extending the Tutte polynomial to cellularly embedded graphs starting from…

Random 2-cell embeddings of a given graph $G$ are obtained by choosing a random local rotation around every vertex. We analyze the expected number of faces, $\mathbb{E}[F_G]$, of such an embedding which is equivalent to studying its average…

A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…

Building on work of Kapouleas and Yang, we construct sequences of minimal surfaces embedded in the round 3-sphere which converge to the Clifford torus counted with multiplicity two and have second fundamental form blowing up at every point…

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

It is shown that each quadrangulation of the 2-torus by the Cartesian product of two cycles can be geometrically realized in (Euclidean) 4-space without hidden symmetries---that is, so that each combinatorial cellular automorphism of the…

Let M be a closed hyperbolic three manifold. We construct closed surfaces which map by immersions into M so that for each one the corresponding mapping on the universal covering spaces is an embedding, or, in other words, the corresponding…

We consider spherical quadrangulations -- spherical embeddings of multigraphs, possibly with loops, so that every face has boundary walk of length 4 -- in which all vertices have degree 3 or 4. Interpreting each degree 4 vertex as a…

We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. Subsequently, in Section 3 we enumerate all possible symmetry…

In this article, we construct complete embedded constant mean curvature surfaces in $\mb{R}^3$ with freely prescribed genus and any number of ends greater than or equal to four. Heuristically, the surfaces are obtained by resolving finitely…

We study surfaces in Euclidean space constructed by the sum of two curves or that are graphs of the product of two functions. We consider the problem to determine all these surfaces with constant Gauss curvature. We extend the results to…

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…

Although the strong embedding of a 3-connected planar graph $G$ on the sphere is unique, $G$ can have different inequivalent strong embeddings on a surface of positive genus. If $G$ is cubic, then the strong embeddings of $G$ on the…