Eulerian and Even-Face Graph Partial Duals

: 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.


Introduction
Geometric duality is a fundamental symmetric property among cellularly embedded graphs. "A plane graph G is Eulerian if and only if its geometric dual G * is bipartite" [1,2] is a classical theorem in graph theory. The sufficiency of this theorem is obvious and holds for any cellularly embedded graphs. 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. However, this does not hold for cellularly embedded graphs on the other surfaces, and one can easily find counter examples such as a cellularly embedding of the complete graph K 5 on the torus and the cellularly embedding of a cycle C n in the real projective plane.
A partial dual of a cellularly embedded graph, introduced by Chmutov [3], generalizes the geometric duality. It was introduced to unify Thistlethwaite theorems [3][4][5][6] in knot theory with a Tutte-like polynomial in graph theory. Partial duality is an impactful extension of geometric duality and has found numerous meaningful applications in mathematics and physics. For the basics of partial duality we refer the readers to the monograph [7].
Recently 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. They left an open problem: Characterize all Eulerian partial duals of a plane graph. Basing on Huggett and Moffatt's partial dual extension, Metsidik and Jin [9] solved this problem using half-edge orientations of medial graphs. Then Deng et al. generalized these results for ribbon graphs [10].
An even-face graph is a cellularly embedded graph without odd degree faces. There is a recent comprehensive research study of even-faced embeddings of complete graphs [11]. In this paper, 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
An embedded graph G = (V(G), E(G)) ⊂ Σ is a graph drawn on a surface Σ such that edges only intersect at their ends. Each path-connected component of Σ \ G is a region of G. A face of G is a region of G homeomorphic to an open disc. G is cellularly embedded if each region of G is a face. There are several equivalent definitions for cellularly embedded graphs. In this paper, we use ribbon graphs. Definition 1 ([12]). A ribbon graph G = (V(G), E(G)) is a surface with boundary represented as the union of two sets of topological discs: A set V(G) of vertices, and a set E(G) of edges such that • the vertices and edges intersect in disjoint line segments (we call such line segments common line segments since they belong to boundaries of both vertex discs and edge discs); • each common line segment lies on the boundary of precisely one vertex and precisely one edge; • every edge contains exactly two common line segments.
Notice that the notion of ribbon graphs corresponds to the reduced band decomposition mentioned in the classical book "Topological graph theory"of Gross and Tucker [13].
Definition 2 ( [14]). Edge line segments of an edge in a ribbon graph are the line segments obtained by deleting the common line segments from the boundary the edge. Vertex line segments of a vertex in a ribbon graph are the line segments that belong to the boundary of the vertex but not the boundary of its incident edges.
Notice that each edge contains exactly two edge line segments and the number of vertex line segments of a vertex equals the degree of the vertex.
The geometric dual G * of a ribbon graph G has a precise description in the language of ribbon graphs. For each boundary component f of G, we take a disc f * and identify f with the boundary of f * , and thus we obtain a surface Σ without boundary. Then G * results when all the original vertex open discs of G are removed from Σ. See [7] for examples.
) denote the arrow-marked ribbon graph obtained as follows: For each edge e ∈ A, arbitrarily orient the boundary of e; place an arrow on each common line segment of e such that the directions of these arrows follow the orientation of the boundary of e; color the two arrows with e; and delete the edge e.

Definition 4 ([8])
. Let G be a ribbon graph and A ⊂ E(G), A c = E(G) \ A. Then the partial dual of G with respect to A, denoted by G A , is given by A few basic properties of partial duals are the following.

Proposition 1 ([3]
). Let G be a ribbon graph and A, B ⊂ E(G). Then partial duality acts disjointly on components.
For more details and examples refer to [7,15]. Here we also give an example to illustrate the definition. Example 1. In Figure 2, the ribbon graph G on the left is equivalent to a cellular embedding of K 5 on torus, and the arrow-marked ribbon graph in the middle is the arrow presentation of G {1,6} . In the arrow presentation, the process of taking the geometric dual is the result of a local operation at each edge e that simply shifts the two arrows colored with e from the two common line segments of e to the two edge line segments of e.

Generalizing a Classical Result of Plane Graphs to Embedded Graphs
The number of edge (or equivalently vertex) line segments lying on a boundary component of a ribbon graph is equal to the degree of the boundary component. A cellularly embedded graph G is even-face if the degree of each boundary component of its equivalent ribbon graph G is even. The degree of a region of an embedded graph is the sum of the degrees of the boundary components belonging to the region. Now we similarly define that an embedded graph is an even-region graph if the degree of each of its regions is even.
A dual G of an embedded graph G in a surface Σ is an embedded graph in the surface Σ formed by placing one vertex in each region of G and embedding an edge between two vertices whenever the two regions of G they lie in share an edge in common. Note that in general G is not unique, but isomorphic as abstract graphs. The vertices of G corresponding to the faces of G have the fixed cyclic orderings of the edges incident to them and the fixed cyclic orders of the vertices are determined by the embedding of G. If G is cellularly embedded, then G = G * and G is unique. A dual G of the graph G embedded in the plane with components G 1 , G 2 , · · · , G p can be formed by one-vertex joins of G * 1 , G * 2 , · · · , G * p . Similar to geometric duals there is the standard immersion G G of G and any fixed G , and therefore we use the natural bijection to its intersected edge e * in G G to identify the edges of G . Theorem 1. Let G be an embedded graph in a connected closed surface. Then G is an even-region graph if and only if G is Eulerian.
Proof. Without loss of generality we assume that G is a graph embedded in a connected closed surface Σ such that if the connected sum Σ 1 #Σ 2 = Σ and G ⊂ Σ 1 then Σ 2 is homeomorphic to a sphere. Otherwise, the dual G of G in Σ 1 is isomorphic to that of G in Σ and G is an even-region graph in Σ 1 if and only if G is an even-region graph in Σ.
Let G be the fat graph in Σ obtained by taking a small neighbourhood of G in Σ such that the vertices and edges of G intersect in disjoint line segments. Then we can similarly define an edge line segment and a vertex line segment for the fat graph G. Now we introduce an operation called amalgamating vertices by an edge as follows: • arbitrarily label the two line segments consisting of one part of l v , one edge line segment of e and one part of l v with l v , l v .
If a region of G is not homeomorphic to a disc, then we can modify the region by a sequence of amalgamating vertices by an edge embedded in the surface Σ into disjoint discs. Thus we modify G by a sequence of amalgamating vertices by an edge embedded in the surface Σ such that very region of the modified fat graph is homeomorphic to a disc. Notice that the vertices of the modified fat graph may not be homeomorphic to discs. Removing the interior of all the vertices of the modified fat graph (removing all the original vertex discs of G and all new added edges) we obtain the fat graph G of an embedded graph G in Σ.
Notice that there is a one to one correspondence between the vertex line segments lying on the boundary components of a region of G and the vertex line segments of the vertex of G corresponding to the region.
Recall that the degree of a vertex equals the number of vertex line segments of the vertex and then the result follows from a well-known theorem: A connected graph is Eulerian if and only if it has no vertex of odd degree.
While (G ) is not necessarily equal to the embedded graph G, the words "evenregion graph" and "Eulerian" can be interchanged in Theorem 1. Since G = G * for any cellularly embedded graph G, we have the following result obtained in [10,14,16] as a corollary.

Corollary 1. Let G be a cellularly embedded graph. Then G is Eulerian if and only if its geometric dual G * is an even-face graph.
Since a connected plane graph is bipartite if and only if it is an even-face graph, we get the classical theorem mentioned in the introduction.
Corollary 2. Let G be a connected plane graph. Then G is Eulerian if and only if its geometric dual G * is bipartite.

Eulerian Partial Duals
Let G be a cellularly embedded graph in Σ. Then G * has a natural cellular embedding in Σ, and therefore there is a standard immersion G G * , where each edge of G intersects exactly one edge of G * at exactly one point. We again use the natural bijection of e ∈ E(G) to its intersected edge e * in G G * to identify the edges of G * and set A * = {e * | e ∈ A} for A ⊆ E(G) accordingly.
Theorem 2 ( [8]). Let G be a connected and cellularly embedded graph, and A ⊆ E(G). Then

Lemma 1. Let G be a connected and cellularly embedded graph, and A ⊆ E(G). Then G A is
Eulerian if and only if G G * − (A c ∪ A * ) is an even-region graph.
Proof. Let G A be Eulerian and Φ := G G * − (A c ∪ A * ). Then, by Theorem 2, Φ is Eulerian. Then, by Theorem 1, Φ is an even-region graph.
Lemma 2. Let G be a connected and cellularly embedded graph, and A ⊆ E(G). Then G G * − (A c ∪ A * ) is an even-region graph if and only if both G| A and G * | A c * are even-region graphs, where G| A = G − A c and A c * = (A c ) * .
Proof. =⇒ We first claim that no region of G| A includes two components of G * | A c * (equivalently no region of G * | A c * includes two components of G| A ).
Consider a region f of G| A . If f is a face of G, then f is an open disc. If f is not a face of G, then f contains some other edges and vertices of G. These edges and vertices divide f into faces of G. Then we can walk between any two of these faces via other such faces since G is connected. Notice that these faces correspond to vertices of G * | A c * and our track from a face to the next one corresponds to an edge of G * | A c * . Thus, the part of G * | A c * lying in f must be connected, and so the claim follows.
Suppose the degree of f is odd, then, by the claim, there is only one component C of G * | A c * lying in f . Notice that the all boundary components of f and all boundary components of C consist of the all boundary components of some regions R 1 , R 2 , · · · , R s of G G * − (A c ∪ A * ). Clearly the sum of the degrees of all boundary components of C is even. Hence the sum of the degrees of R 1 , R 2 , · · · , R s is odd. Thus at least one of R 1 , R 2 , · · · , R s has an odd degree, a contradiction to the assumption that G G * − (A c ∪ A * ) is an even-region graph.
Thus G| A is an even-region graph. By the same argument, G * | A c * is also an evenregion graph.
⇐= Suppose that there is a region R of G G * − (A c ∪ A * ) with an odd degree. Clearly R lies in a region, say again f , of G| A . Then we again using a similar method of necessity showing that the degree of f is odd.
From the proof of Lemma 2 we have already seen that the degree of each boundary component of G * | A c * is even, similarly we can prove that if G G * − (A c ∪ A * ) is an even-region graph then the degree of each boundary component of G| A is also even. Thus we have the following corollary. By Lemmas 1 and 2 we have Theorem 3. Let G be a connected and cellularly embedded graph, and A ⊆ E(G). Then G A is Eulerian if and only if both G| A and G * | A c * are even-region graphs.
By Lemma 1 and Corollary 3 we have Theorem 4. Let G be a connected and cellularly embedded graph, and A ⊆ E(G). Then G A is Eulerian if and only if the degree of every boundary component of G| A and G * | A c * is even.

Permissible Orientations of Medial Graphs
Definition 5 ([9]). By a half-edge orientation of a graph we mean an assignment of an orientation for each half-edge of the graph. An edge of a graph with a half-edge orientation is said to be consistent if the orientations of two half-edges of the edge define an orientation of the edge, otherwise it is an inconsistent edge.
Notice that a half-edge orientation of the graph with only consistent edges can be viewed as an orientation of a graph.
Let G be a cellularly embedded graph in a surface Σ. Then the medial graph G m of G is constructed as follows: In the first place, a vertex v e on each edge e of G; second, for each face f with boundary v 1 e 1 v 2 e 2 · · · v t e t v 1 , draw the edges v e 1 v e 2 , v e 2 v e 3 , · · · , v e t v e 1 in a non-intersecting way inside the face f . It is easy to check that G m is a four-regular cellularly embedded graph in Σ.
A vertex v e of the medial graph G m of a ribbon graph G under a fixed half-edge orientation of G m is a semi-crossing if the directions of the four half-edges incident to v e are along one of the following three cyclic orders with respect to v e : (incoming, incoming, outgoing, outgoing); (incoming, incoming, incoming, incoming); (outgoing, outgoing, outgoing, outgoing). There are two types of semi-crossing vertices of G m relative to edges of G, see Figure 3. One is called c-vertices and the other is called d-vertices. An edge e of G is said to be a c-edge (respectively, d-edge) if v e in G m is a c-vertex (respectively, d-vertex).  An orientable loop l of an embedded graph G is called trivial if l * is a bridge of G . Note that an even-region graph contains no trivial loops. In this section we will consider half-edge orientations of G m satisfying the following three conditions:   For simplicity we call such a half-edge orientation of G m with the above three conditions a permissible orientation. Notice that these three conditions are all self-dual and G m = (G * ) m , and therefore there is a one to one correspondence between c-edges (respectively, d-edges) of G and d-edges (respectively, c-edges) of G * .
While there are many permissible orientations for a medial graph, we are interested in the permissible orientations with different c-, d-vertex partitions. Let t(G), b and l be the number of spanning trees, bridges and trivial loops of a cellularly embedded graph G, respectively. Then the medial graph G m of G admits at least t(G) and at most 2 |E(G)|−b−l permissible such orientations. The upper bound is clear from the definition. Next we prove the lower bound. Let T be a spanning tree of the ribbon graph G equivalent to G and A = E(T), A c = E(G) \ A. Then G A is a bouquet, a graph with one vertex, i.e., G A is Eulerian. By Theorem 4, each boundary component of G| A and G * | A c * has an even degree. Alternately orient each edge line segment lying on each boundary component of G| A and G * | A c * by incoming or outgoing arcs with respect to the boundary component, see figure in page 12 for an example. Since there is no odd degree boundary component the orientation is consistent. Then we transfer the alternating transverse orientations of A c * to the longitudinal orientations of the edges A c as figure in page 7. Hence all the edges of A are d-edges and the edges of A c are c-edges. The cor d-status of the vertices of G m are inherited from the edges of G; then, we direct the half-edges around each vertex as in Figure 3. Obviously, this half-edge orientation of G m is a permissible orientation. Since t(G) = 2 |E(G)|−b−l = 1 for a tree G, G m only admits one such permissible orientation, and thus the bounds are tight.
In the following section, we will show that the partial dual G A of a cellularly embedded graph G is Eulerian if and only if A is the set of d-edges determined by a permissible orientation of G m . As in the example given in the following, we decrease the corresponding c-, d-edge partitions according to equivalent embeddings of G so that we gain all Eulerian partial duals of a cellularly embedded graph efficiently.
Example 2. We first find a permissible orientation of the medial graph of a ribbon graph K 5 with all c-vertices, see picture 1 in Figure 5. In order to obtain permissible orientations with different c-, d-edge partitions, we change some of the c-vertices to d-vertices considering equivalent ribbon graphs of K 5 . Since c-vertices satisfy the above three conditions, we only need to check the d-vertices in every changing process, see pictures 2-28 in Figure 5.

Characterizing all Eulerian Partial Duals of Cellularly Embedded Graphs
An embedded Eulerian graph with a half-edge orientation is alternating if we follow the cyclic order of the directed half-edges incident to each vertex, we find head-tail-· · ·head-tail. Notice that an embedded Eulerian graph G admits at most 2 |V(G)| alternating half-edge orientations and obviously admits at least one alternating half-edge orientation.
Theorem 5. Let G be a connected and cellularly embedded graph. Then the partial dual G A is Eulerian if and only if A is the set of d-edges arising from a permissible orientation of G m .
Proof. ⇐= By Condition 2 of the definition of a permissible orientation we assume that G| A contains no trivial loop.
Let C be a boundary component of G| A and e 1 , e 2 , · · · , e n be the all edge line segments lying on C. Then, by Condition 3, the directions of the half-edges of G m incident to the half-vertex-discs v e 1 , v e 2 , · · · , v e n identified by the edge line segments e 1 , e 2 , · · · , e n match up as in Figure 6, where G| A is black and G m is blue and the red arcs join the half-edge of v e i to the half-edge of v e i+1 . Thus we have a half-edge cyclic sequence x 1 x 2 y 1 y 2 · · · x n−1 x n y n−1 y n , where x i is a half edge with clockwise direction and y i with anticlockwise direction, and x i y i−1 and y j x j+1 with the subscript modulo n represent half-vertex discs v e i and v e j , respectively. This in turn implies the half-vertex discs v e 1 , v e 2 , · · · , v e n can be partitioned into two equal cardinality sets {v e i = x i y i−1 | i = 2, 4, · · · , n} and {v e j = y j x j+1 | j = 1, 3, · · · , n − 1}. Thus n is even. Hence any boundary component of G| A has an even degree. By the self-duality of the permissible direction, we know that any boundary component of G * | (A c ) * also has an even degree, i.e., G| A and G * | (A c ) * are even-region graphs. Then the result follows from Theorem 3.
. By Theorem 2, an embedded graph Φ is Eulerian. Hence Φ has alternating half-edge orientations. In the following, an alternating half-edge orientation of Φ is transformed into a permissible orientation of G m .
First, consider the fat graphs Φ and Φ in Σ and then transfer longitudinal directions of the half-edges of Φ to transverse directions of the edge line segments of Φ as in Figure 7. Second, we transfer transverse directions of edge line segments of Φ to directions of the edges of G as follows: Edge line segments of A are directed transversely and half-edges in A c are directed longitudinally. Then we will show that these transverse and longitudinal directions of the edges of G lead a permissible orientation of G m . The cor d-status of the vertices of G m are inherited from the edges of G, and the half-edges around each vertex were directed as in Figure 3. Condition 1 holds clearly.
By Theorem 3, G| A is an even-region graph. Hence G| A contains no trivial loops, i.e., d-edges (i.e., edges in A ) cannot be trivial loops. By the self-duality of the definition, c-edges (i.e., edges in A c ) cannot be bridges and therefore Condition 2 holds.
Finally we show that Condition 3 also holds. Consider all d-edges incident to a vertex. Clearly d-edges incident to a same vertex correspond to the edges lying on a same boundary component of Φ | A * . Moreover, if the two edges are successive in the cyclic order of the end vertex then the two corresponding edges are adjacent on the boundary component. Recall that the half-edge orientation of Φ is alternating, and by the construction of Φ we have that Φ | A * = G| A is also an alternating half-edge direction, thus Condition 3 holds. Since the permissible orientation is self-dual, the directions of the c-edges on a same boundary component of G are satisfied concerning Condition 3.

Example 3.
Edges of the ribbon graph K 5 are numerated as in Figure 2. We take A to be the set of d-edges arising from the first seven permissible orientations of (K 5 ) m as shown in Figure 5, and obtain some Eulerian partial duals as shown in Figure 8. Since K 5 is cellularly embedded in torus, its all partial duals are also orientable (there is no half twist in the edges). In Figure 8, we contract all edges into line segments and paint the taking dual edges with blue. Since G A * = G A c for A ⊆ E(G), and by Corollary 1, we have: Proposition 2. Let G be a connected and cellularly embedded graph, and A ⊆ E(G). Then G A is Eulerian if and only if G A c is an even-face graph.
Notice again that the words "Eulerian" and "even-face graph" can be interchanged in Proposition 2. Then the following corollary immediately follows from Theorem 5.

Corollary 4.
Let G be a connected and cellularly embedded graph. Then the partial dual G A is an even-face graph if and only if A is the set of c-edges arising from a permissible orientation of G m .

Admissible Orientations and Even-Face Partial Duals
In this section, we provide another method to characterize even-face graph partial duals and also Eulerian partial duals of a cellularly embedded graph in terms of biseparations and half-edge orientations. ). Let G be a connected ribbon graph, v ∈ V(G), and let P and Q be non-trivial, connected ribbon subgraphs of G. Then G is said to be a 1-sum of P and Q, written G = P ⊕ Q, if G = P ∪ Q and P ∩ Q = {v} (see the picture on the left in Figure 9). The 1-sum is said to be involved at the vertex v. If there is an arc on the boundary of v with the property that all edges of P incident to v meet it on this arc, and no edges of Q do, then G is the join of P and Q, written G = P ∨ Q (see the picture on the right in Figure 9).

Admissible Orientations of Medial Graphs, 1-Sum, Join and Biseparation of Ribbon Graphs
v v P Q P Q P ∨ Q P ⊕ Q We say that G can be written as a sequence of 1-sums if G contains subgraphs H 1 , · · · , H l such that We say that an edge subset A of connected ribbon graph G defines a biseparation if either

Characterizing All Even-Face Partial Duals of Cellularly Embedded Graphs
Theorem 6. Let G be a connected and cellularly embedded graph, and A ⊆ E(G). Then G A is an even-face graph if and only if A c defines an even biseparation of G A and the degree of each vertex in V(G| A ) ∪ V(G * | A c * ) \ C is even, where C is the set of all vertices lying on the boundaries of all regions of G G * − (A c ∪ A * ) containing both vertices of G| A and G * | A c * .
Proof. Let Φ = G G * − (A c ∪ A * ). By Theorem 2, Φ ∼ = G A and therefore there is an embedding Φ of Φ equivalent to G A . While Φ is cellularly embedded and Φ possibly not, the only difference between the two embedded graphs is the orderings of the half edges of some vertices corresponding to the regions not homeomorphic to discs. By the proof of Lemma 2 the fat graph Φ can be written as a sequence of joins, in which each join contains a component of G * | A * and a component of G| A c . Let the sequence of joins be involved at the vertices v 1 , · · · , v s . Then the ribbon graph Φ can be written as a sequence of 1-sums involved at the vertices v 1 , · · · , v s , in which each 1-sum contains a component of G * | A * and a component of G| A c . Thus A c defines a biseparation of Φ , i.e., A c defines a biseparation of G A . Furthermore the faces of Φ , which contain no vertex line segments of {v 1 , · · · , v s } on their boundaries, correspond to the vertices of G| A and G * | A c * that are not lying on the boundary of a region of Φ containing both vertices of G| A and G * | A c * . Then the result follows from Corollary 1.

Theorem 7.
Let G be a connected and cellularly embedded graph. Then the partial dual G A is an even-face graph if and only if A c defines an even biseparation of G A and A is the set of c-edges arising from an admissible orientation of G m .
Proof. Let C := B v∈B {v}, where B is the boundary of a region of G G * − (A c ∪ A * ) containing both vertices of G| A and G * | A c * . ⇐= Let v ∈ V(G| A ) \ C and e 1 , e 2 , · · · , e n be the edge sequence incident to v. By the definition of the admissible orientation, the directions of the half edges of v e 1 , v e 2 , · · · , v e n match up. Then we can show that n is even using a similar method as in the sufficiency of Theorem 5, i.e., the degree of v in G|A is even. By the self-duality of the admissible orientation, we have that any vertex of G * | A c * which is not lying on the boundary of a common region of G| A and G * | A c * has an even degree. Then the result follows from Theorem 6.
=⇒ Let Φ = G G * − (A c ∪ A * ). By Theorem 6 we have that A c defines an even biseparation of G A . By Theorem 2 Φ ∼ = G A and therefore there is an embedding Φ of Φ equivalent to G A . By the assumption Φ is an even-face graph.
We alternately orient each edge line segment lying on a boundary component of the ribbon graph Φ of Φ by incoming or outgoing arcs with respect to the boundary component, see Figure 11 for an example. Since Φ is an even-face graph the number of the edge line segments lying on a boundary component of Φ is even, and therefore the orientation is consistent. First, we transfer transverse directions of the edge line segments of each edge of Φ to longitudinal half-edge directions of the dual edge of Φ as in Figure 6. Second, we transfer longitudinal half-edge directions of Φ to directions of the edges of G as follows: Edge line segments belonging to A c are directed transversely and half-edges in A are directed longitudinally. Then we will show that the transverse and longitudinal directions of the edges of G lead an admissible orientation of G m .
The cor d-status of the vertices of G m are inherited from the edges of G, and the half-edges around each vertex were oriented as in Figure 3. We only need to check that inconsistent edges have not occurred in the following two cases. Case 1: On the boundary of a face of G m corresponding to a boundary component of G consisting only of d-edges.
Case 2: On the boundary of a face of G m encircling a vertex of G only incident to c-edges. Notice that a boundary component of G consisting only of d-edges corresponds to a boundary component of Φ , and a vertex of G only incident to c-edges also corresponds to a boundary component of Φ . So the result follows.
The biseparation of G defined by an edge subset A is Eulerian if the degree of each vertex of the sequence of 1-sums involved is even.
Corollary 5. Let G be a connected and cellularly embedded graph. Then the partial dual G A is Eulerian if and only if A c defines a Eulerian biseparation of G A and A is the set of d-edges arising from an admissible orientation of G m .