Related papers: Obstructions for two-vertex alternating embeddings…

A $k$-stack layout (also called a $k$-page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing edges with respect to the vertex order. The stack number (book…

Testing if a given graph $G$ contains the $k$-vertex path $P_k$ as a minor or as an induced minor is trivial for every fixed integer $k\geq 1$. However, the situation changes for the problem of checking if a graph can be modified into $P_k$…

The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. One of the most studied types of drawings in this area are the…

In this paper, we study grid-obstacle representations of graphs where we assign grid-points to vertices and define obstacles such that an edge exists if and only if an $xy$-monotone grid path connects the two endpoints without hitting an…

We consider the problem of classifying those graphs that arise as an undirected square of an oriented graph by generalising the notion of quasi-transitive directed graphs to mixed graphs. We fully classify those graphs of maximum degree…

In this paper we study properties of intersection graphs of k-bend paths in the rectangular grid. A k-bend path is a path with at most k 90 degree turns. The class of graphs representable by intersections of k-bend paths is denoted by…

In 1996 M. Traizet obtained singly periodic minimal surfaces with Scherk ends of arbitrary genus by desingularizing a set of vertical planes at their intersections. However, in Traizet's work it is not allowed that three or more planes…

We study when the mapping class group of an infinite-type surface $S$ admits an action with unbounded orbits on a connected graph whose vertices are simple closed curves on $S$. We introduce a topological invariant for infinite-type…

We investigate a class of 2-edge coloured bipartite graphs known as alternating signed bipartite graphs (ASBGs) that encode the information in alternating sign matrices. The central question is when a given bipartite graph admits an…

Suppose that $X$ and $Y$ are surfaces of finite topological type, where $X$ has genus $g\geq 6$ and $Y$ has genus at most $2g-1$; in addition, suppose that $Y$ is not closed if it has genus $2g-1$. Our main result asserts that every…

We study the impact of forbidding short cycles to the edge density of $k$-planar graphs; a $k$-planar graph is one that can be drawn in the plane with at most $k$ crossings per edge. Specifically, we consider three settings, according to…

The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.

A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

This paper gives a uniform, self-contained and direct approach to a variety of obstruction-theoretic problems on manifolds of dimension 7 and 6. We give necessary and sufficient cohomological criteria for the existence of various…

We give obstructions - in terms of Gaussian maps - for a marked Prym curve $(C,\alpha,T_d)$ to admit a singular model lying on an Enriques surface with only one $d$-ordinary point singularity and in such a way that $T_d$ corresponds to the…

For a class $\mathcal C$ of graphs, we define $\mathcal C$-edge-brittleness of a graph $G$ as the minimum $\ell$ such that the vertex set of $G$ can be partitioned into sets inducing a subgraph in $\mathcal C$ and there are $\ell$ edges…

A torsor under a k-group scheme G on a variety X over a number field k imposes a descent obstruction against the existence of rational points on X. We discuss the finite descent obstruction, that is for all such torsors under finite…

A class of graphs G is chi-bounded if the chromatic number of the graphs in G is bounded by some function of their clique number. We show that the class of intersection graphs of simple x-monotone curves in the plane intersecting a vertical…

We provide a finite forbidden induced subgraph characterization for the graph class $\varUpsilon_k$, for all $k \in \mathbb{N}_0$, which is defined as follows. A graph is in $\varUpsilon_k$ if for any induced subgraph, $\Delta \leq \chi -1…