Separability and the genus of a partial dual

DOI10.1016/J.EJC.2012.09.003zbMATH Open1254.05047arXiv1108.3526OpenAlexW2089899763MaRDI QIDQ691589FDOQ691589

Authors: Iain Moffatt 

Publication date: 3 December 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1108.3526

Recommendations

• Partial duality and closed 2-cell embeddings
• Partial duality for ribbon graphs. I: distributions
• A characterization of partially dual graphs
• Bipartite partial duals and circuits in medial graphs
• Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial

zbMATH Keywords

partial dualitygeometric dualitygenus of an embedded graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Cited In (21)

• Partial duality for ribbon graphs. III: A gray code algorithm for enumeration
• On a conjecture of Gross, Mansour and Tucker
• Evaluations of topological Tutte polynomials
• Partial duality of hypermaps
• Partial-dual polynomials and signed intersection graphs
• Edge colourings and topological graph polynomials
• Inductive tools for connected delta-matroids and multimatroids
• Eulerian partial duals of plane graphs
• Partial-dual genus polynomial as a weight system
• Partial duality for ribbon graphs. I: distributions
• Ribbon graph minors and low-genus partial duals
• Partial duals of plane graphs, separability and the graphs of knots
• Bipartite partial duals and circuits in medial graphs
• From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
• New results for non-interpolating partial-dual Euler-genus polynomials
• A characterization theorem for nonmaximal partial-dual planar graphs and the maximum partial-dual genus for a planar triangulated graph
• Title not available (Why is that?)
• The structure of delta-matroids with width one twists
• Excluded minors and the ribbon graphs of knots
• Partial duality and closed 2-cell embeddings
• Matroids, delta-matroids and embedded graphs

This page was built for publication: Separability and the genus of a partial dual

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691589)