Separability and the genus of a partial dual
arXiv:1108.3526 · doi:10.1016/j.ejc.2012.09.003
Abstract
Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of an embedded graph, partial duality does not. Here we are interested in the problem of determining which edge sets of an embedded graph give rise to a partial dual of a given genus. This problem turns out to be intimately connected to the separability of the embedded graph. We determine how separability is related to the genus of a partial dual. We use this to characterize partial duals of graphs embedded in the plane, and in the real projective plane, in terms of a particular type of separation of an embedded graph. These characterizations are then used to determine a local move relating all partially dual graphs in the plane and in the real projective plane.
References in corpus (15)
- The Jones polynomial and graphs on surfaces
- The multivariate signed Bollobas-Riordan polynomial
- The Kauffman bracket of virtual links and the Bollobás-Riordan polynomial
- Knot invariants and the Bollobas-Riordan polynomial of embedded graphs
- Twisted duality for embedded graphs
- Alternating sum formulae for the determinant and other link invariants
- Topological graph polynomials and quantum field theory, Part II: Mehler kernel theories
- Symmetric links and Conway sums: volume and Jones polynomial
- Partial duality and Bollobas and Riordan's ribbon graph polynomial
- Bipartite partial duals and circuits in medial graphs
- A characterization of partially dual graphs
- Unsigned state models for the Jones polynomial
- Non-orientable quasi-trees for the Bollobas-Riordan polynomial
- Partial duals of plane graphs, separability and the graphs of knots
- On the Seifert graphs of a link diagram and its parallels
Cited by in corpus (8)
- On the interplay between embedded graphs and delta-matroids
- Matroids, Delta-matroids and Embedded Graphs
- On a conjecture of Gross, Mansour and Tucker
- Inductive tools for connected ribbon graphs, delta-matroids and multimatroids
- Excluded minors and the ribbon graphs of knots
- Partial-dual genus polynomial as a weight system
- Edge colourings and topological graph polynomials
- The structure of delta-matroids with width one twists