Related papers: Which Cubic Graphs have Quadrangulated Spherical I…
Cubic planar $n$-vertex graphs with faces of length at most $6$, e.g., fullerene graphs, have diameter in $\Omega(\sqrt{n})$. It has been suspected, that a similar result can be shown for cubic planar graphs with faces of bounded length.…
S. Blank solved the question of classifying immersed circles in $\mathbb{R}^{2}$ that extend to immersed disks, and how many topologically inequivalent disks can be extended. The quetions of various cases in $2$-dimension have already been…
We present and discuss several old and new methods for mapping a circular disc to a square. In particular, we present analytical expressions for mapping each point (u,v) inside the circular disc to a point (x,y) inside a square region.…
In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the…
A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…
For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…
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…
Let $S=\{K_{1,3},K_3,P_4\}$ be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph $G$ into graphs taken from any non-empty $S'\subseteq S$. The problem is known to be NP-complete for any…
We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…
There exist cubical transition systems containing cubes having an arbitrarily large number of faces. A regular transition system is a cubical transition system such that each cube has the good number of faces. The categorical and…
We initiate the study of diameter computation in geometric intersection graphs from the fine-grained complexity perspective. A geometric intersection graph is a graph whose vertices correspond to some shapes in $d$-dimensional Euclidean…
There are three types of involutions on a cubic fourfold; two of anti-symplectic type, and one symplectic. Here we show that cubics with involutions exhibit the full range of behaviour in relation to rationality conjectures. Namely, we show…
The chromatic index of a cubic graph is either 3 or 4. Edge-Kempe switching, which can be used to transform edge-colorings, is here considered for 3-edge-colorings of cubic graphs. Computational results for edge-Kempe switching of cubic…
We classify special self-birational transformations of the smooth quadric threefold and fourfold, $Q^3$ and $Q^4$. It turns out that there is only one such example in each dimension. In the case of $Q^3$, it is given by the linear system of…
Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs…
Partial cubes are graphs isometrically embeddable into hypercubes. In this paper it is proved that every cubic, vertex-transitive partial cube is isomorphic to one of the following graphs: $K_2 \, \square \, C_{2n}$, for some $n\geq 2$, the…
Using equivariant geometry, we find a universal formula that computes the number of times a general cubic surface arises in a family. As applications, we show that the PGL(4) orbit closure of a generic cubic surface has degree 96120, and…
We show that every cubic graph can be drawn in the plane with straight-line edges using only the four basic slopes $\{0,\pi/4,\pi/2,3\pi/4\}$. We also prove that four slopes have this property if and only if we can draw $K_4$ with them.
In this paper, we characterize and study dynamical properties of cubic vector fields on the sphere $\mathbb{S}^2 = \{(x, y, z) \in \mathbb{R}^3 ~|~ x^2+y^2+z^2 = 1\}$. We start by classifying all degree three polynomial vector fields on…
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…