Characterizations of bipartite and Eulerian partial duals of ribbon graphs
From MaRDI portal
Publication:2279283
DOI10.1016/J.DISC.2019.111637zbMATH Open1429.05047arXiv1706.03831OpenAlexW2975712197WikidataQ127201899 ScholiaQ127201899MaRDI QIDQ2279283FDOQ2279283
Authors: Qingying Deng, Metrose Metsidik, Xianan Jin
Publication date: 12 December 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Huggett and Moffatt characterized all bipartite partial duals of a plane graph in terms of all-crossing directions of its medial graph. Then Metsidik and Jin characterized all Eulerian partial duals of a plane graph in terms of semi-crossing directions of its medial graph. Plane graphs are ribbon graphs with genus 0. In this paper, we shall first extend Huggett and Moffatt's result to any orientable ribbon graph and provide an example to show that it is not true for non-orientable ribbon graphs. Then we characterize all Eulerian partial duals of any ribbon graph in terms of crossing-total directions of its medial graph, which are much more simple than semi-crossing directions.
Full work available at URL: https://arxiv.org/abs/1706.03831
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Graph theory
- A course in combinatorics.
- Graphs on surfaces
- Graphs on surfaces. Dualities, polynomials, and knots
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- The Jones polynomial and graphs on surfaces
- THISTLETHWAITE'S THEOREM FOR VIRTUAL LINKS
- Eulerian partial duals of plane graphs
- Bipartite partial duals and circuits in medial graphs
- Title not available (Why is that?)
Cited In (11)
- Partial-dual polynomials and signed intersection graphs
- Combinatorics of trivalent ribbon graphs with two faces
- Eulerian partial duals of plane graphs
- Bipartite partial duals and circuits in medial graphs
- Characterization of regular checkerboard colourable twisted duals of ribbon graphs
- New results for non-interpolating partial-dual Euler-genus polynomials
- Counterexamples to a conjecture by Gross, Mansour and Tucker on partial-dual genus polynomials of ribbon graphs
- A Degree Theorem for the Space of Ribbon Graphs
- Eulerian and even-face ribbon graph minors
- A generalization of Eagon–Reiner’s theorem and a characterization of bi-CMt bipartite and chordal graphs
- A characterization of partially dual graphs
This page was built for publication: Characterizations of bipartite and Eulerian partial duals of ribbon graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279283)