Related papers: Plane-filling curves on all uniform grids
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all…
A plane curve is called strange if its tangent line at any smooth point passes through a fixed point, called the strange point. In this paper, we study $\mathbb{A}^1$-curves on the complement of a rational strange curve of degree $p$ in…
Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\bf \#P}-complete even if the graph is known to be planar \cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric…
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non-1-planar graph $G$ is minimal if the graph $G-e$ is 1-planar for every…
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is…
Consider a curve $\Gamma$ in a domain $D$ in the plane $\boldsymbol R^2$. Thinking of $D$ as a piece of paper, one can make a curved folding $P$ in the Euclidean space $\boldsymbol R^3$. The singular set $C$ of $P$ as a space curve is…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
We consider the following problem: Given a set $S$ of $n$ distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on $S$? Each spanning path must be crossing-free, but edges from different paths…
We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
This paper concerns the number of lattice points in the plane which are visible along certain curves to all elements in some set S of lattice points simultaneously. By proposing the concept of level of visibility, we are able to analyze…
Given a plane curve $\gamma: S^1\to \mathbb R^2$, we consider the problem of determining the minimal number $I(\gamma)$ of inflections which curves $\mbox{diff}(\gamma)$ may have, where $\mbox{diff}$ runs over the group of diffeomorphisms…
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from…
A graph drawn on the plane is called $1$-plane if each edge is crossed at most once by another edge. In this paper, we show that every $4$-connected $1$-plane graph has a connected spanning plane subgraph. We also show that there exist…
Planar curves with periodically varying curvature arise in the natural sciences as the result of a wide variety of periodic processes. The total curvature of a periodic arc in such curves constrains their symmetry. It is shown how the total…
We consider unbounded curves without endpoints. Isomorphism is equivalence up to translation. Self-avoiding plane-filling curves cannot be periodic, but they can satisfy the local isomorphism property: We obtain a set $\Omega $ of coverings…
Fixed a point O on a non-singular surface S and a complete mO-primary ideal I in its local ring, the curves on the surface X obtained by blowing-up I are studied in terms of the base points of I. Criteria for the principality of these…
We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…