Related papers: Minimal Polynomials for the Coordinates of the Har…
We prove that the ends of a properly immersed simply or one connected minimal surface in H(2)xR contained in a slab of height less than \pi of H(2)xR, are multi-graphs. When such a surface is embedded then the ends are graphs. When embedded…
This note is about uniform, plane, singly connected, regular Hall-plates with an arbitrary number of contacts exposed to a uniform magnetic field of arbitrary strength. In practice, the regular symmetry is the most common one. If the…
We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…
How many copies of a parallelepiped are needed to ensure that for every point in the parallelepiped a copy of each other point exists, such that the distance between them equals the distance of the pair of points when the opposite sites of…
Recently, there has been interest in representing single graphs by multiple drawings; for example, using graph stories, storyplans, or uncrossed collections. In this paper, we apply this idea to orthogonal graph drawing. Due to the…
This paper is devoted to a study of the connection between the immersion functions of two-dimensional surfaces in Euclidean or hyperbolic spaces and classical orthogonal polynomials. After a brief description of the soliton surfaces…
We introduce a decomposition method for the distributed calculation of exact Euclidean Minimum Spanning Trees in high dimensions (where sub-quadratic algorithms are not effective), or more generalized geometric-minimum spanning trees of…
In this paper, we study the computational complexity of finding the \emph{geodetic number} of graphs. A set of vertices $S$ of a graph $G$ is a \emph{geodetic set} if any vertex of $G$ lies in some shortest path between some pair of…
Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…
We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This confirms a conjecture of Albenque and Knauer and implies that there is a polynomial time…
Configuration polynomials generalize the classical Kirchhoff polynomial defined by a graph. Their study sheds light on certain polynomials appearing in Feynman integrands. Contact equivalence provides a way to study the associated…
The classical problem of characterizing the graphs with bounded eigenvalues may date back to the work of Smith in 1970. Especially, the research on graphs with smallest eigenvalues not less than $-2$ has attracted widespread attention.…
We show that, for every n and every surface $\Sigma$, there is a graph U embeddable on $\Sigma$ with at most cn^2 vertices that contains as minor every graph embeddable on $\Sigma$ with n vertices. The constant c depends polynomially on the…
In this note we give a short and elementary proof of a more general version of Whitney's theorem that 3-connected planar graphs have a unique embedding in the plane. A consequence of the theorem is that cubic plane graphs cannot be embedded…
A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of…
A planar graph $G$ is called a pentagulation of an $n$-gon ($n\geq$ is an integer) if all faces of $G$ are pentagons, except one, which is an $n$-gon. A $3$-connected pentagulation $G$ of an $n$-gon is called minimal if it has the smallest…
We study the complexity of finding the \emph{geodetic number} on subclasses of planar graphs and chordal graphs. A set $S$ of vertices of a graph $G$ is a \emph{geodetic set} if every vertex of $G$ lies in a shortest path between some pair…
In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph $G$, we say that a plane subgraph $H\subseteq G$ is a \textit{plane-saturated subgraph} if adding any edge (possibly with…
We study a generalization of additive bases into a planar setting. A planar additive basis is a set of non-negative integer pairs whose vector sumset covers a given rectangle. Such bases find applications in active sensor arrays used in,…
We propose a way to derive polynomial invariants of closed, orientable $3$-manifolds from Heegaard diagrams via cellularly embedded graphs. Given a Heegaard diagram of an irreducible $3$-manifold $M$, we associate a Heegaard graph $G\subset…