Bipartite partial duals and circuits in medial graphs
- 128 Downloads
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.
Mathematics Subject Classification (2000)05C10 05C45
Unable to display preview. Download preview PDF.
- J. Bondy and U. Murty: Graph theory, Graduate Texts in Mathematics 244, Springer, Berlin, 2008.Google Scholar
- T. Krajewski, V. Rivasseau and F. Vignes-Tourneret: Topological graph polynomials and quantum field theory, Part II: Mehler kernel theories, ann. Henri Poincaré 12 (2011) 1–63 arXiv:0912.5438.Google Scholar