Abstract

Eulerian and bipartite graph is a dual symmetric concept in Graph theory. It is well-known that a plane graph is Eulerian if and only if its geometric dual is bipartite. In this paper, we generalize the well-known result to embedded graphs and partial duals of cellularly embedded graphs, and characterize Eulerian and even-face graph partial duals of a cellularly embedded graph by means of half-edge orientations of its medial graph.

Highlights

  • With the help of Jordan Curve Theorem, the necessity of this theorem can be deduced by showing that a Eulerian plane graph is proper twoface-colourable

  • This does not hold for cellularly embedded graphs on the other surfaces, and one can find counter examples such as a cellularly embedding of the complete graph K5 on the torus and the cellularly embedding of a cycle Cn in the real projective plane

  • We further study the following topics: Extending plane bipartite graphs to even-region graphs, we generalize the above classical result to embedded graphs and partial duals of cellularly embedded graphs, and characterize all Eulerian and all even-face graph partial duals of a cellularly embedded graph by using two methods

Read more

Summary

Introduction

A partial dual of a cellularly embedded graph, introduced by Chmutov [3], generalizes the geometric duality. Huggett and Moffatt [8] gave an extension of the above dual symmetry between plane Eulerian and bipartite graphs to partial duality and characterized all bipartite partial duals of plane graphs by means of oriented circuits in their medial graphs. We further study the following topics: Extending plane bipartite graphs to even-region graphs, we generalize the above classical result to embedded graphs and partial duals of cellularly embedded graphs, and characterize all Eulerian and all even-face graph partial duals of a cellularly embedded graph by using two methods

Ribbon Graphs and Partial Duals
Generalizing a Classical Result of Plane Graphs to Embedded Graphs
Eulerian Partial Duals
Permissible Orientations of Medial Graphs
Characterizing all Eulerian Partial Duals of Cellularly Embedded Graphs
Admissible Orientations and Even-Face Partial Duals
Characterizing All Even-Face Partial Duals of Cellularly Embedded Graphs
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.