Related papers: Models of Simply-connected Trivalent $2$-dimension…
Classes of branched surfaces extend the classes of surfaces or 2-dimensional manifolds satisfying suitable properties and defined in various manners. Reeb spaces of smooth maps of suitable classes into surfaces whose codimensions are…
Inspired by the Taubes-Wu construction of $\mathcal{C}^{1,\alpha}$ two-valued harmonic functions by the use of symmetry, we construct minimal surfaces with stratified branching sets as graphs of $\mathcal{C}^{1,\alpha}$ two-valued…
Bispanning graphs are undirected graphs with an edge set that can be decomposed into two disjoint spanning trees. The operation of symmetrically swapping two edges between the trees, such that the result is a different pair of disjoint…
A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other vertices (if any) are distributed on three concave chains. A pseudo-triangulation~$\mathcal{T}$ of a point set~$P$ in~$\mathbb{R}^2$ is a partitioning…
We classify trivalent graphs with 16 vertices and 16 edges that arise from intersecting two quadratic surfaces in tropical 3-space. There are 4,009 such graphs, representing maximally degenerate stable models of elliptic curves realized as…
Round fold maps are smooth maps on closed manifolds which are locally represented as the product maps of Morse functions and identity maps on open disks and whose singularity is realized as concentrically embedded spheres. The author…
Hypergraphs provide a natural way to represent polyadic relationships in network data. For large hypergraphs, it is often difficult to visually detect structures within the data. Recently, a scalable polygon-based visualization approach was…
We construct examples of $C^\infty$ smooth submanifolds in ${\Bbb C}^n$ and ${\Bbb R}^n$ of codimension 2 and 1, which intersect every complex, respectively real, analytic curve in a discrete set. The examples are realized either as compact…
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least $2k$ vertices is {\it $k$-linked} if, for every set of $2k$ distinct vertices organised in arbitrary $k$ pairs of vertices, there…
Regular edge-colored graphs encode colored triangulations of pseudo-manifolds. Here we study families of edge-colored graphs built from a finite but arbitrary set of building blocks, which extend the notion of $p$-angulations to arbitrary…
We show that a closed orientable 3--dimensional manifold admits a round fold map into the plane, i.e. a fold map whose critical value set consists of disjoint simple closed curves isotopic to concentric circles, if and only if it is a graph…
In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
A key result in computational 3-manifold topology is that any two triangulations of the same 3-manifold are connected by a finite sequence of bistellar flips, also known as Pachner moves. One limitation of this result is that little is…
The Reeb space of a smooth function is a topological and combinatoric object and fundamental and important in understanding topological and geometric properties of the manifold of the domain. It is the graph and a topological space endowed…
We provide combinatorial realizations, according to the usual objects/moves scheme, of the following three topological categories: (1) pairs (M,v) where M is a 3-manifold (up to diffeomorphism) and v is a (non-singular vector) field, up to…
The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity…
Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known…
For a simple graph $G$, the $3$-distance graph, $D_3(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $3$ in the graph $G$. For a connected graph $G$, we provide some conditions for…