Sequential machines uniquely determine directed graphs. A path in a sequential machine may be specified by a starting state and an input sequence. A uniform Hamiltonian touring sequence (UHTS) is an input sequence that specifies a Hamiltonian path regardless of the starting state. We present a polynomial time algorithm that...
A graph may he drawn in many different ways. We investigate how to draw a graph nicely, in the sense of being visually pleasing. We discuss the history of this field, and look at several algorithms for drawing graphs.
For planar graphs this problem has been algorithmically solved: that is,...