I will describe how to characterize the Seifert graphs of link diagrams, and how, using the notion of partial duality in ribbon graphs, this leads to a generalization of the classical result that a plane graph is Eulerian if and only if its geometric dual is bipartite. This is joint work with Iain Moffatt and Natalia Virdee.