Related papers: Separability and the genus of a partial dual
The geometric dual of a cellularly embedded graph is a fundamental concept in graph theory and also appears in many other branches of mathematics. The partial dual is an essential generalization which can be obtained by forming the…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge and taking the partial dual with respect to the edge. These two operations give rise to an action of S_3^{|E(G)|},…
In 2009 Chmutov introduced the idea of partial duality for embeddings of graphs in surfaces. We discuss some alternative descriptions of partial duality, which demonstrate the symmetry between vertices and faces. One is in terms of band…
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…
Let $G$ be an embedded graph and $A$ an edge subset of $G$. The partial dual of $G$ with respect to $A$, denoted by $G^A$, can be viewed as the geometric dual $G^*$ of $G$ over $A$. If $A=E(G)$, then $G^A=G^*$. Denote by $\gamma(G^A)$ the…
Recently, Gross, Mansour and Tucker introduced the partial-dual genus polynomial of a ribbon graph as a generating function that enumerates the partial duals of the ribbon graph by genus. It is analogous to the extensively-studied…
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
Recently, Chmutov introduced the partial duality of ribbon graphs, which can be regarded as a generalization of the classical Euler-Poincar\'e duality. The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ is an enumeration of the…
Partial duality is a duality of ribbon graphs relative to a subset of their edges generalizing the classical Euler-Poincare duality. This operation often changes the genus. Recently J.L.Gross, T.Mansour, and T.W.Tucker formulated a…
There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity…
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…
Graph embedding aims at learning a vector-based representation of vertices that incorporates the structure of the graph. This representation then enables inference of graph properties. Existing graph embedding techniques, however, do not…
The splitting number is effective to distinguish the embedded topology of plane curves, and it is not determined by the fundamental group of the complement of the plane curve. In this paper, we give a generalization of the splitting number,…
We generalize the natural duality of graphs embedded into a surface to a duality with respect to a subset of edges. The dual graph might be embedded into a different surface. We prove a relation between the signed Bollobas-Riordan…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…