Related papers: Facial diagrams and cycle double cover

We consider regular tessellations of the plane as infinite graphs in which $q$ edges and $q$ faces meet at each vertex, and in which $p$ edges and $p$ vertices surround each face. For $1/p + 1/q = 1/2$, these are tilings of the Euclidean…

Barnette conjectured that all cubic $3$-connected plane graphs with maximum face size at most $6$ are hamiltonian. We provide a method of construction of a hamiltonian cycle (in dual terms) in an arbitrary cubic, $3$-connected plane graph…

The problem of whether and how one can compute the twin-width of a graph -- along with an accompanying contraction sequence -- lies at the forefront of the area of algorithmic model theory. While significant effort has been aimed at…

We study single-flip dynamics in sets of three-dimensional rhombus tilings with fixed polyhedral boundaries. This dynamics is likely to be slowed down by so-called ``cycles'': such structures arise when tilings are encoded via the…

A Hamiltonian cycle of a graph is a closed path that visits each site once and only once. I study a field theoretic representation for the number of Hamiltonian cycles for arbitrary graphs. By integrating out quadratic fluctuations around…

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph decomposes into a unique number of cycles if and only if it does not contain two…

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 examine the conditions under which a signed graph contains an edge or a vertex that is contained in a unique negative circle or a unique positive circle. For an edge in a unique signed circle, the positive and negative case require the…

A graph is said to be cyclic $k$-edge-connected, if at least $k$ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of $k$ edges is called a cyclic-$k$-edge cutset and it is called a trivial…

We prove the filling area conjecture in the hyperelliptic case. In particular, we establish the conjecture for all genus 1 fillings of the circle, extending P. Pu's result in genus 0. We translate the problem into a question about closed…

Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…

An ordinary voltage graph embedding of a graph in a surface encodes a certain kind of highly symmetric covering space of that surface. Given an ordinary voltage graph embedding of a graph $G$ in a surface with voltage group $A$ and a…

Edge ideals of finite simple graphs are well-studied over polynomial rings. In this paper, we initiate the study of edge ideals over exterior algebras, specifically focusing on the depth and singular varieties of such ideals. We prove an…

We find all analytic surfaces in space R^3 such that through each point of the surface one can draw two circular arcs fully contained in the surface. The proof uses a new decomposition technique for quaternionic matrices.

A face-transitive surface is a triangulated 2-dimensional manifold whose automorphism group acts transitively on its set of triangles. In this paper, we investigate this class of highly symmetric surface triangulations. We identify seven…

We study parallel surfaces and dual surfaces of cuspidal edges. We give concrete forms of principal curvature and principal direction for cuspidal edges. Moreover, we define ridge points for cuspidal edges by using those. We clarify…

It is folklore that the cycle space of graphs of polytopes is generated by the cycles bounding the 2-faces. We provide a proof of this result that bypass homological arguments, which seem to be the most widely known proof. As a corollary,…

A longstanding open question of Archdeacon and Craft asks whether every complete graph has a minimum genus embedding with at most one nontriangular face. We exhibit such an embedding for each complete graph except $K_8$, the complete graph…

We present results on partitioning the vertices of $2$-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of S\'ark\"ozy: the vertex set of every $2$-edge-colored graph can be…