Related papers: On a class of linearizable planar geodesic webs

A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected $n$-vertex graph has a path cover with at most $\lceil n/2 \rceil$ paths. We prove Gallai's conjecture for…

We construct a geodesic net in the plane with four unbalanced (boundary) vertices that has 16 balanced vertices and does not contain proper geodesic subnets. This is the first example of an irreducible geodesic net in the Euclidean plane…

We show that for at most three closed geodesics with linearly independent directions, the homeomorphism type of its complement in the 3-torus is determine by the orbit of their direction vectors subspaces under the action of…

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

We show that the isomorphism of 3-connected planar graphs can be decided in deterministic log-space. This improves the previously known bound UL$\cap$coUL of Thierauf and Wagner.

In this note, we show that sub-Riemannian manifolds can contain branching normal minimizing geodesics. This phenomenon occurs if and only if a normal geodesic has a discontinuity in its rank at a non-zero time, which in particular for a…

The paper gives topological as well as rigid isotopy classification of smooth irreducible algebraic curves in the real projective 3-space for the case when the degree of the curve is at most six and its genus is at most one.

In this article, we study holomorphic isometric embeddings between bounded symmetric domains. In particular, we show the total geodesy of any holomorphic isometric embedding between reducible bounded symmetric domains with the same rank.

We classify noninvertible, holomorphic selfmaps of the projective plane that preserve an algebraic web. In doing so, we obtain interesting examples of critically finite maps.

This survey gives a brief overview of theoretically and practically relevant algorithms to compute geodesic paths and distances on three-dimensional surfaces. The survey focuses on polyhedral three-dimensional surfaces.

This paper completes the classification of nets of conics containing at least one double line in $\mathrm{PG}(2,q)$ for $q$ even. This classification contributes to the classification of partially symmetric tensors in $\mathbb{F}_q^3…

The similar sublattices of a planar lattice can be classified via its multiplier ring. The latter is the ring of rational integers in the generic case, and an order in an imaginary quadratic field otherwise. Several classes of examples are…

We prove that every triconnected planar graph is definable by a first order sentence that uses at most 15 variables and has quantifier depth at most $11\log_2 n+43$. As a consequence, a canonic form of such graphs is computable in $AC^1$ by…

We analyze flat S_3-covers, attempting to create structures parallel to those found in the abelian theory. We use an initial local analysis as a guide in finding a global description.

We classify completely the surfaces of general type whose canonical map is 3-to-1 onto a surface of minimal degree in projective space. These surfaces fall into 5 distinct classes and we give explicit examples belonging to each of these…

We determine a particular class of Roter type warped product manifolds. We show that every manifold of that class admits a geodesic mapping onto a some Roter type warped product manifold. Moreover, both geodesically related manifolds are…

It is well-known that every planar or projective planar graph can be 3-colored so that each color class induces a forest. This bound is sharp. In this paper, we show that there are in fact exponentially many 3-colorings of this kind for any…

In this paper, we study some classes of submanifolds of codimension one and two in the Page space. These submanifolds are totally geodesic. We also compute their curvature and show that some of them are constant curvature spaces. Finally we…

We give a practical formula for counting irreducible nodal genus-three plane curves that a fixed generic complex structure on the normalization. As an intermediate step, we enumerate rational plane curves that have a $(3,4)$-cusp.

We derive a quadratic-time algorithm for the genus distribution of any 3-regular, biconnected series-parallel graph, which we extend to any biconnected series-parallel graph of maximum degree at most 3. Since the biconnected components of…