Related papers: Chirality and principal graph obstructions
Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…
Let k be a field of characteristic different from 2. There can be an obstruction for an indecomposable principally polarized abelian threefold (A,a) over k to be a Jacobian over k. It can be computed in terms of the rationality of the…
An $n$-dimensional manifold $M$ ($n\ge 3$) is called {\it generalized graph manifold} if it is glued of blocks that are trivial bundles of $(n-2)$-tori over compact surfaces (of negative Euler characteristic) with boundary. In this paper…
We study the problem of finding a maximum cardinality minimal separator of a graph. This problem is known to be NP-hard even for bipartite graphs. In this paper, we strengthen this hardness by showing that for planar bipartite graphs, the…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
Let $k,l$ be nonnegative integers. A graph $G$ is $(k,l)$-polar if its vertex set admits a partition $(A,B)$ such that $A$ induces a complete multipartite graph with at most $k$ parts, and $B$ induces a disjoint union of at most $l$ cliques…
The orientation completion problem for a class of oriented graphs asks whether a given partially oriented graph can be completed to an oriented graph in the class by orienting the unoriented edges of the partially oriented graph.…
We prove that every internally 4-connected non-planar bipartite graph has an odd K_3,3 subdivision; that is, a subgraph obtained from K_3,3 by replacing its edges by internally disjoint odd paths with the same ends. The proof gives rise to…
If $N \subset P,Q \subset M$ are type II_1 factors with $N' \cap M = C id$ and $[M:N]$ finite we show that restrictions on the standard invariants of the elementary inclusions $N \subset P$, $N \subset Q$, $P \subset M$ and $Q \subset M$…
In this paper, we present three necessary conditions for recognizing point visibility graphs. We show that this recognition problem lies in PSPACE. We state new properties of point visibility graphs along with some known properties that are…
We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs,…
A strongly connected graph is strongly biconnected if after ignoring the direction of its edges we have an undirected graph with no articulation points. A 3-vertex strongly biconnected graph is a strongly biconnected digraph that has the…
Forbidden characterizations may sometimes be the most natural way to describe families of graphs, and yet these characterizations are usually very hard to exploit for enumerative purposes. By building on the work of Gioan and Paul (2012)…
The area of judicious partitioning considers the general family of partitioning problems in which one seeks to optimize several parameters simultaneously, and these problems have been widely studied in various combinatorial contexts. In…
In this note, we introduce a family of bipartite graphs called path restricted ordered bipartite graphs and present it as an abstract generalization of some well known geometric graphs like unit distance graphs on convex point sets. In the…
We develop a structural approach to simultaneous embeddability in temporal sequences of graphs, inspired by graph minor theory. Our main result is a classification theorem for 2-connected temporal sequences: we identify five obstruction…
The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After…
Deciding whether a planar graph (even of maximum degree $4$) is $3$-colorable is NP-complete. Determining subclasses of planar graphs being $3$-colorable has a long history, but since Gr\"{o}tzsch's result that triangle-free planar graphs…
We introduce I/O-optimal certifying algorithms for bipartite graphs, as well as for the classes of split, threshold, bipartite chain, and trivially perfect graphs. When the input graph is a class member, the certifying algorithm returns a…