The problem of representing a graph in a plane "neatly," for instance with a minimum number of edge crossings.