Related papers: Plane curves in an immersed graph in $R^2$

We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…

We develop an essentially algebraic method to study biharmonic curves into an implicit surface. Although our method is rather general, it is especially suitable to study curves into surfaces defined by a polynomial equation: in particular,…

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…

The splitting number of a plane irreducible curve for a Galois cover is effective to distinguish the embedded topologies of plane curves. In this paper, we define a connected number of any plane curve for a Galois cover whose branch divisor…

Given a planar graph $G$, we consider drawings of $G$ in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding $\pi$ of the vertex set of $G$ into…

We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…

We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…

The aim of this paper is to investigate the sufficient condition for the invariance of a normal curve on a smooth immersed surface under isometry. We also find the the deviations of the tangential and normal components of the curve with…

We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have been recently applied to obtain various properties of…

We prove that a closed immersed plane curve with total curvature $2\pi m$ has entropy at least $m$ times the entropy of the embedded circle, as long as it generates a type I singularity under the curve shortening flow (CSF). We construct…

In this paper we collect the main properties of free curves in the complex projective plane and a lot of conjectures and open problems, both old and new. In the quest to understand the mystery of free curves, many tools were developed and…

In this paper we prove that a graph is a string graph (the intersection graph of curves in the plane) if and only if it admits a drawing in the plane with certain properties. This also allows us to define an algebraic obstruction, similar…

An ordered graph $G_<$ is a graph with a total ordering $<$ on its vertex set. A monotone path of length $k$ is a sequence of vertices $v_1<v_2<\ldots<v_k$ such that $v_iv_{j}$ is an edge of $G_<$ if and only if $|j-i|=1$. A bi-clique of…

We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…

This is the paper as published. The topology of a complex plane curve singularity with real branches is deduced from any real deformation having delta crossings. An example of the computation of the global geometric monodromy of a…

For a graph $G$, let $\sigma_{2}(G)$ be the minimum degree sum of two non-adjacent vertices in $G$. A chord of a cycle in a graph $G$ is an edge of $G$ joining two non-consecutive vertices of the cycle. In this paper, we prove the following…

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of nonorientable surfaces into which such graphs may be embedded. In a previous paper by the authors, the problem of…

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.

Graph manifolds form important classes of $3$-dimensional closed and orientable manifolds. For example, {\it Seifert} manifolds are graph manifolds where hyperbolic manifolds are not. In applying singularity theory of differentiable maps to…

Fix g>1. Every graph of large enough tree-width contains a g x g grid as a minor; but here we prove that every four-edge-connected graph of large enough tree-width contains a g x g grid as an immersion (and hence contains any fixed graph…