Related papers: On Morphing 1-Planar Drawings

Representation learning on graphs is a fundamental problem that can be crucial in various tasks. Graph neural networks, the dominant approach for graph representation learning, are limited in their representation power. Therefore, it can be…

The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of…

We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…

An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge. This paper establishes the local structure of outer-1-planar…

The graph groupoids of directed graphs are topologically isomorphic if and only if there is a diagonal-preserving ring *-isomorphism between the Leavitt path algebras.

We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…

Let X and Y be curves over a finite field. In this article we explore methods to determine whether there is a rational map from Y to X by considering L-functions of certain covers of X and Y and propose a specific family of covers to…

Graph filters are a staple tool for processing signals over graphs in a multitude of downstream tasks. However, they are commonly designed for graphs with a fixed number of nodes, despite real-world networks typically grow over time. This…

Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing…

The transformer architecture has shown remarkable success in various domains, such as natural language processing and computer vision. When it comes to graph learning, transformers are required not only to capture the interactions between…

For two-parameter families of dissipative twist maps, we investigate the dynamics of invariant graphs as well as the thresholds for their existence and breakdown. Our main results are as follows: (1) For arbitrarily small $C^r$…

It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…

We propose a novel method for topological analysis of unweighted graphs which is based on \textit{persistent homology}. The proposed method maps the input graph to a complete weighted graph where the weighting function maps each edge to a…

A monotone drawing of a planar graph $G$ is a planar straight-line drawing of $G$ where a monotone path exists between every pair of vertices of $G$ in some direction. Recently monotone drawings of planar graphs have been proposed as a new…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…

Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…

This paper considers 1-string representations of planar graphs that are order-preserving in the sense that the order of crossings along the curve representing vertex $v$ is the same as the order of edges in the clockwise order around $v$ in…

Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding durable patterns, such as triangles and paths, which persist…

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…

The union of a directed family of topological groups can be equipped with two noteworthy topologies: the finest topology making each injection continuous, and the finest group topology making each injection continuous. This begs the…