Bipartite partial duals and circuits in medial graphs
Combinatorics
2013-11-18 v2
Abstract
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented circuits in its medial graph.
Cite
@article{arxiv.1106.4189,
title = {Bipartite partial duals and circuits in medial graphs},
author = {Stephen Huggett and Iain Moffatt},
journal= {arXiv preprint arXiv:1106.4189},
year = {2013}
}
Comments
v2: minor changes. To appear in Combinatorica