1. R. Aleliunas, A Simple Graph Traversal Problem, Department of Computer Science, University of Toronto, Technical Report 120, April, 1978.
2. Random walks, universal traversal sequences, and the complexity of maze problems;Aleliunas,1979
3. Universal sequences for complete graphs;Alon;Discrete Appl. Math.,1990
4. Bounds on universal sequences;Bar-Noy;SIAM J. Comput.,1989
5. Time–space tradeoffs for undirected graph traversal;Beame,1990