Partitions of a graph into paths with prescribed endvertices and lengths. Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph. Connected subgraphs with small degree sums in 3-connected planar graphs. Diagonal transformations of graphs and Dehn twists of surfaces.
Every graph is an integral distance graph in the plane.
On the pagenumber of complete bipartite graphs. Diagonal transformations in quadrangulations and Dehn twists preserving cycle parities. Three-cycle reversions in oriented planar triangulations. Connected spanning subgraphs of 3-connected planar graphs. Long cycles passing through a specified edge in a 3-connected graph.