Bipartite partial duals and circuits in medial graphs (Q485497)

From MaRDI portal
Revision as of 18:14, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Bipartite partial duals and circuits in medial graphs
scientific article

    Statements

    Bipartite partial duals and circuits in medial graphs (English)
    0 references
    0 references
    0 references
    9 January 2015
    0 references
    A graph \(G\) cellularly embedded on a surface has a natural geometric dual on the same surface formed by swapping the roles of vertices and faces while preserving adjacency. A plane graph is Eulerian if and only if its goemetric dual is bipartite. \textit{S. Chmutov} [J. Comb. Theory, Ser. B 99, No. 3, 617--638 (2009; Zbl 1172.05015)] introduced a partial dual based on dualizing only edges from a subset \(A \subset E(G)\). This partial dual may be on a different surface. It can be described in terms of ribbon graphs and arrow-marked ribbon graphs, or in terms of a 3-edge-colorable GEM corresponding to the embedding of \(G\). The authors characterize all bipartite partial duals of a plane graph. They use oriented circuits in the embedding's medial graph.
    0 references
    partial dual
    0 references
    medial graph
    0 references
    planar
    0 references

    Identifiers