# Medial graph

In the mathematical discipline of graph theory, the **medial graph** of plane graph *G* is another graph *M(G)* that represents the adjacencies between edges in the faces of *G*. Medial graphs were introduced in 1922 by Ernst Steinitz to study combinatorial properties of convex polyhedra,^{[1]} although the inverse construction was already used by Peter Tait in 1877 in his foundational study of knots and links.^{[2]}^{[3]}

The medial graph of a disconnected graph is the disjoint union of the medial graphs of each connected component. The definition of medial graph also extends without modification to graph embeddings on surfaces of higher genus.

For a plane graph *G*, twice the evaluation of the Tutte polynomial at the point (3,3) equals the sum over weighted Eulerian orientations in the medial graph of *G*, where the weight of an orientation is 2 to the number of saddle vertices of the orientation (that is, the number of vertices with incident edges cyclically ordered "in, out, in out").^{[5]} Since the Tutte polynomial is invariant under embeddings, this result shows that every medial graph has the same sum of these weighted Eulerian orientations.

The medial graph definition can be extended to include an orientation. First, the faces of the medial graph are colored black if they contain a vertex of the original graph and white otherwise. This coloring causes each edge of the medial graph to be bordered by one black face and one white face. Then each edge is oriented so that the black face is on its left.

A plane graph and its dual do not have the same directed medial graph; their directed medial graphs are the transpose of each other.

Using the directed medial graph, one can effectively generalize the result on evaluations of the Tutte polynomial at (3,3). For a plane graph *G*, *n* times the evaluation of the Tutte polynomial at the point (*n*+1,*n*+1) equals the weighted sum over all edge colorings using *n* colors in the directed medial graph of *G* so that each (possibly empty) set of monochromatic edges forms a directed Eulerian graph, where the weight of a directed Eulerian orientation is 2 to the number of monochromatic vertices.^{[6]}