An algorithm for drawing a graph symmetrically. Some minimal average-distance graphs. An algorithm for constructing a planar layout of a graph with a regular polygon as outer face. On coset diagrams for pseudo-similar vertices. An algorithm for finding a long path in a graph.
Balanced network flows.
Reconstructing graphs as subsumed graphs of hypergraphs, and some self-complementary triple systems. An extension of the multi-path algorithm for finding Hamilton cycles. On minimal neighbourhood-connected graphs. More nonreconstructible hypergraphs. Hypomorphisms, orbits, and reconstruction.