Lower bounds on universal traversal sequences based on chains of length five

Abstract

Universal traversal sequences for cycles require length Ω(n1.43), improving the previous bound of Ω(n1.33). For d ≥ 3, universal traversal sequences for d-regular graphs require length Ω(d0.57n2.43). For constant d, the best previous bound was Ω(n2.33). © 1995 Academic Press, Inc.