Related papers: Obstructions of Connectivity 2 for Embedding Graph…

We present several characterizations of circle graphs, which follow from Bouchet's circle graph obstructions theorem.

Given a map f: M \to M of closed topological manifolds we define torsion obstructions whose vanishing is a necessary condition for f being homotopy equivalent to a projection of a locally trivial fiber bundle. If N = S^1, these torsion…

In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1; V2;E), where the maximum degree of vertices in V2 is 4, can G be embedded on a two dimensional grid such that each vertex in V1 is drawn as a…

The \emph{thinness} of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Graphs with thinness at most two include, for example, bipartite convex graphs. Many…

A symmetric $m\times m$ matrix $M$ with entries taken from $\{0,1,\ast\}$ gives rise to a graph partition problem, asking whether a graph can be partitioned into $m$ vertex sets matched to the rows (and corresponding columns) of $M$ such…

We give new examples of closed smooth 4-manifolds which support singular metrics of nonpositive curvature, but no smooth ones, thereby answering affirmatively a question of Gromov. The obstruction comes from patterns of incompressible…

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…

It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…

Graphs are a representation of structured data that captures the relationships between sets of objects. With the ubiquity of available network data, there is increasing industrial and academic need to quickly analyze graphs with billions of…

We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.

Advantages of hypercube network and torus topology are used to derive an embedded architecture for product network known as torus embedded hypercube scalable interconnection network. This paper analyzes torus embedded hypercube network…

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…

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 prove integral curvature bounds in terms of the Betti numbers for compact submanifolds of the Euclidean space with low codimension. As an application, we obtain topological obstructions for $\delta$-pinched immersions. Furthermore, we…

This work re-examines a classical construction of a 2-connected (simple) graph where every intermediate graph is 2-connected before detailing an analogous construction for 3-connected graphs which requires a graph equivalence relation…

We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…

In recent years, there has been significant interest in characterizing the induced subgraph obstructions to bounded treewidth and pathwidth. While this has recently been resolved for pathwidth, the case of treewidth remains open, and prior…

We determine which bipartite graphs embedded in a torus are move-reduced. In addition, we classify equivalence classes of such move-reduced graphs under square/spider moves. This extends the class of minimal graphs on a torus studied by…

Which surfaces can be realized with two-dimensional faces of the five-dimensional cube (the penteract)? How can we visualize them? In recent work, Aveni, Govc, and Roldan, show that there exist 2690 connected closed cubical surfaces up to…

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…