Related papers: Obstructions for two-vertex alternating embeddings…
A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of minor-minimal non-members. The long-standing problem of…
A Meyniel obstruction is an odd cycle with at least five vertices and at most one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as an induced subgraph. Here we give a O(n^2) algorithm that, for any graph, finds…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of nonorientable surfaces into which such graphs may be embedded. In a previous paper by the authors, the problem of…
Planar graphs can be represented as intersection graphs of different types of geometric objects in the plane, e.g., circles (Koebe, 1936), line segments (Chalopin \& Gon{\c{c}}alves, 2009), \textsc{L}-shapes (Gon{\c{c}}alves et al, 2018).…
We explore what could make recognition of particular intersection-defined classes hard. We focus mainly on unit grid intersection graphs (UGIGs), i.e., intersection graphs of unit-length axis-aligned segments and grid intersection graphs…
We analyse properties of geometric intersection graphs to show the strict containment between some natural classes of geometric intersection graphs. In particular, we show the following properties: - A graph $G$ is outerplanar if and only…
It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph…
For every orientable surface of finite negative Euler characteristic, we find a right-angled Artin group of cohomological dimension two which does not embed into the associated mapping class group. For a right-angled Artin group on a graph…
Several graph properties are characterized as the class of graphs that admit an orientation avoiding finitely many oriented structures. For instance, if $F_k$ is the set of homomorphic images of the directed path on $k+1$ vertices, then a…
Several types of generically-nondegenerate Poisson structures can be effectively studied as symplectic structures on naturally associated Lie algebroids. Relevant examples of this phenomenon include log-, elliptic, $b^k$-, scattering and…
We derive an obstruction to representing a homology class of a symplectic 4-manifold by an embedded, possibly disconnected, symplectic surface.
We call an oriented odd cycle alternating if it has exactly one vertex whose in-degree and out-degree are both positive. In this paper, we investigate whether certain graphs admit an orientation that avoids alternating odd cycles as…
We investigate the following problem: Given two embeddings G_1 and G_2 of the same abstract graph G on an orientable surface S, decide whether G_1 and G_2 are isotopic; in other words, whether there exists a continuous family of embeddings…
We present a family of index 1 abelian current graphs whose derived embeddings can be modified into triangulations of $K_{12s}$ for $s \geq 4$. Our construction is significantly simpler than previous methods for finding genus embeddings of…
In the present paper we describe topological obstructions to embedding of a (complex) matrix algebra bundle into a trivial one under some additional arithmetic condition on their dimensions. We explain a relation between this problem and…
Let $k$ be a field of characteristic zero and ${\bar k}$ an algebraic closure of $k$. For a geometrically integral variety $X$ over $k$, we write ${\bar k}(X)$ for the function field of ${\bar X}=X\times_k{\bar k}$. If $X$ has a smooth…
Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi:…
We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most…
Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and…
Given finitely many connected polygonal obstacles $O_1,\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\em visibility graph} of $P$ with obstacles $O_1,\dots,O_k$ is the (geometric) graph…