Related papers: A Whitney type theorem for surfaces: characterisin…

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…

In this paper, we contribute toward a classification of two-variable polynomials by classifying (up to an automorphism of $C^2$) polynomials whose Newton polygon is either a triangle or a line segment. Our classification has several…

A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph by more than a constant factor. We prove that the branchwidth of connected hypergraphs without bridges and…

Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…

We prove that, except in some low-complexity cases, every locally injective simplicial map between pants graphs is induced by a $\pi_1$-injective embedding between the corresponding surfaces.

Tutte's spring embedding theorem states that, for a three-connected planar graph, if the outer face of the graph is fixed as the complement of some convex region in the plane, and all other vertices are placed at the mass center of their…

We prove that every connected locally finite regular graph has a double cover which is isomorphic to a Schreier graph.

We consider minimal immersions in MxR. We study existence and uniqueness of associate and conjugate isometric immersions to a given minimal surface. We use the theory of univalent harmonic map between surfaces. Then we study the geometry of…

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

The Whitney-Graustein theorem states that regular closed curves in the 2-plane are classified, up to regular homotopy, by their rotation number. Here we give a simple proof based on contact geometry.

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…

The study of graph drawings on 2-surfaces is an active area of mathematical research. Our main results are criteria for integer and modulo 2 embeddability of graphs to surfaces.

There are two main approaches to building locally flat embedded surfaces in 4-manifolds: direct methods which geometrically manipulate a given map of a surface, and more indirect methods using surgery theory. Both rely on Freedman-Quinn's…

We prove by explicit construction that graph braid groups and most surface groups can be embedded in a natural way in right-angled Artin groups, and we point out some consequences of these embedding results. We also show that every…

We show if the flow polynomial of a bridgeless graph G has only integral roots, then G is the dual graph to a planar chordal graph. We also show that for 3-connected cubic graphs, the same conclusion holds under the weaker hypothesis that…

We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…

The central theorem of topological graph theory states that the graph minor relation is a well-quasi-order on graphs. It has far-reaching consequences, in particular in the study of graph structures and the design of (parameterized)…

We argue that for a smooth surface S, considered as a ramified cover over the projective plane branched over a nodal-cuspidal curve B one could use the structure of the fundamental group of the complement of the branch curve to understand…

Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…