Characterizations of Eulerian and even-face partial duals of ribbon graphs
Combinatorics
2017-06-14 v1
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.
Keywords
Cite
@article{arxiv.1706.03831,
title = {Characterizations of Eulerian and even-face partial duals of ribbon graphs},
author = {Qingying Deng and Xian'an Jin},
journal= {arXiv preprint arXiv:1706.03831},
year = {2017}
}
Comments
19 pages, 9 figures (26 files)