In this paper we establish a relationship between these two concepts, in
particular, we show that universal traversal sequences can be efficiently
converted into universal exploration sequences. We also study conversion
of universal exploration sequences for d-regular graphs into universal
exploration sequences for d'-regular graphs. Further, we also show certain
self-correcting properties of traversal and exploration sequences and we
propose a candidate for a universal exploration sequence.
Paper available at ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2003/2003-41.ps.gz