Related papers: Planar graphs with separation are dp-minimal
In this note, we propose a straightforward method to produce an straight-line embedding of a planar graph where one face of a graph is fixed in the plane as a star-shaped polygon. It is based on minimizing discrete Dirichlet energies,…
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…
Felsner introduced a cycle reversal, namely the `flip' reversal, for \alpha-orientations (i.e., each vertex admits a prescribed out-degree) of a graph G embedded on the plane and further proved that the set of all the \alpha-orientations of…
Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…
In \cite{TY}, we investigate the pair $(P, \Supp(P))$ of minimal path $P$ and its supporting sub-digraph $\Supp(P)$ in the path complex of a digraph $G$ under the strongly regular condition. In this paper, first, we consider the special…
An embedding of a graph on a translation surface is said to be \emph{systolic} if each vertex of the graph corresponds to a singular point (or marked point) and each edge corresponds to a shortest saddle connection on the translation…
A metric graph is a pair $(G,d)$, where $G$ is a graph and $d:E(G) \to\mathbb{R}_{\geq0}$ is a distance function. Let $p \in [1,\infty]$ be fixed. An isometric embedding of the metric graph $(G,d)$ in $\ell_p^k = (\mathbb{R}^k, d_p)$ is a…
The splitting number of a graph $G=(V,E)$ is the minimum number of vertex splits required to turn $G$ into a planar graph, where a vertex split removes a vertex $v \in V$, introduces two new vertices $v_1, v_2$, and distributes the edges…
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…
A graph is \emph{$(\mathcal{I}, \mathcal{F})$-partitionable} if its vertex set can be partitioned into two parts such that one part $\mathcal{I}$ is an independent set, and the other $\mathcal{F}$ induces a forest. A graph is…
We present new algorithm for growth of non-clustered planar graphs by aggregation of cells with given distribution of size and constraint of connectivity k=3 per node. The emergent graph structures are controlled by two parameters--chemical…
We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic…
By assigning a probability measure via the spectrum of the normalized Laplacian to each graph and using L^p Wasserstein distances between probability measures, we define the corresponding spectral distances d_p on the set of all graphs.…
A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…
The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…
We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…
We prove that circle graphs (intersection graphs of circle chords) can be embedded as intersection graphs of rays in the plane with polynomial-size bit complexity. We use this embedding to show that the global curve simplification problem…