English
Related papers

Related papers: Outerspatial 2-complexes: Extending the class of o…

200 papers

We study smooth, proper embeddings of noncompact surfaces in 4-manifolds, focusing on exotic planes and annuli, i.e., embeddings pairwise homeomorphic to the standard embeddings of R^2 and R^2-int D^2 in R^4. We encounter two uncountable…

Geometric Topology · Mathematics 2025-01-08 Robert E. Gompf

A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. It is proved that…

Combinatorics · Mathematics 2013-04-24 Xin Zhang

We study the potentially undecidable problem of whether a given 2-dimensional CW complex can be embedded into $\mathbb{R}^4$. We provide operations that preserve embeddability, including joining and cloning of 2-cells, as well as…

Combinatorics · Mathematics 2024-08-26 Agelos Georgakopoulos , Martin Winter

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…

Combinatorics · Mathematics 2022-04-20 Christian Millichap , Fabian Salinas

We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…

Computational Geometry · Computer Science 2015-07-16 David Eppstein

We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another where the mapping is not given. In particular,…

Computational Geometry · Computer Science 2007-05-23 C. A. Duncan , A. Efrat , C. Erten , S. Kobourov , J. S. B. Mitchell

A generic immersion of a planar graph into the 2-space is said to be knotted if there does not exist a trivial embedding of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space…

Geometric Topology · Mathematics 2020-05-19 Youngsik Huh , Ryo Nikkuni

A well-known result by Kant [Algorithmica, 1996] implies that n-vertex outerplane graphs admit embedding-preserving planar straight-line grid drawings where the internal faces are convex polygons in $O(n^2)$ area. In this paper, we present…

Computational Geometry · Computer Science 2025-08-28 Michael A. Bekos , Giordano Da Lozzo , Fabrizio Frati , Giuseppe Liotta , Antonios Symvonis

We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…

Combinatorics · Mathematics 2021-05-20 Victor Chepoi , Kolja Knauer , Manon Philibert

We demonstrate the existence of minimal simplicial $n$-complexes which inevitably contain a nonsplittable two-component link formed by an $(n-1)$-sphere and an $n$-sphere in any embedding into $\mathbb{R}^{2n}$. This provides a…

Geometric Topology · Mathematics 2026-03-17 Ryo Nikkuni

We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have…

Combinatorics · Mathematics 2016-09-06 Neil Robertson , Paul Seymour , Robin Thomas

A proof that every outerplanar graph is \Delta+2 colorable. This is slightly stronger then an unpublished result of Wang Shudong, Ma Fangfang, Xu Jin, and Yan Lijun proving the same for 2-connected outerplanar graphs.

Combinatorics · Mathematics 2008-06-19 Maksim Maydanskiy

A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every…

Combinatorics · Mathematics 2017-06-12 Dan Archdeacon , Matt DeVos , Stefan Hannie , Bojan Mohar

In this paper, we study the outerplanarity of planar graphs, i.e., the number of times that we must (in a planar embedding that we can initially freely choose) remove the outerface vertices until the graph is empty. It is well-known that…

Data Structures and Algorithms · Computer Science 2024-07-08 Therese Biedl , Debajyoti Mondal

We show that there exists an outerplanar graph on $O(n^{c})$ vertices for $c = \log_2(3+\sqrt{10}) \approx 2.623$ that contains every tree on $n$ vertices as a subgraph. This extends a result of Chung and Graham from 1983 who showed that…

Subsurface projection has become indispensable in studying the geometry of the mapping class group and the curve complex of a surface. When the subsurface is an annulus, this projection is sometimes called relative twisting. We give two…

Group Theory · Mathematics 2012-05-04 Matt Clay , Alexandra Pettet

Tutte's embedding theorem states that every 3-connected graph without a $K_5$ or $K_{3,3}$ minor (i.e. a planar graph) is embedded in the plane if the outer face is in convex position and the interior vertices are convex combinations of…

Computational Geometry · Computer Science 2023-03-28 Marc Alexa

Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three. In this paper we affirmatively answer this question for the…

Discrete Mathematics · Computer Science 2014-01-06 Michael A. Bekos , Martin Gronemann , Chrysanthi N. Raftopoulou

We study threefolds X in a projective space having as hyperplane section a smooth surface with an elliptic fibration. We first give a general theorem about the possible embeddings of such surfaces with Picard number two. More precise…

Algebraic Geometry · Mathematics 2008-09-15 Angelo Felice Lopez , Roberto Munoz , Jose' Carlos Sierra

The complement of the hyperplanes $\{x_i=x_j\}$, for all $i\neq j$ in $M^n$, for $M$ an aspherical $2$-manifold, is known to be aspherical. Here we consider the situation, when $M$ is a $2$-dimensional orbifold. We prove this complement to…

Algebraic Topology · Mathematics 2024-08-30 S K Roushon