Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Universal traversal sequences for d-regular n-vertex graphs require length Ω(d2n2 + dn2 log( n d)), for 3 ≤d≤ n 3 - 2. This is nearly tight for d = Θ(n). We also introduce and study several variations on the problem, e.g., edge-universal traversal sequences, showing how improved lower bounds on these would improve the bounds given above. © 1992.
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Leo Liberti, James Ostrowski
Journal of Global Optimization
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics