Length lower bounds for reflecting sequences and universal traversal sequences

DOI10.1016/j.disc.2015.01.018zbMath1371.05306OpenAlexW2023463918MaRDI QIDQ2407040

H. K. Dai

Publication date: 28 September 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.01.018

zbMATH Keywords

graph traversalreflecting sequenceuniversal traversal sequence

Mathematics Subject Classification ID

Transversal (matching) theory (05D15) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Universal sequences for complete graphs
• Lower bounds on the length of universal traversal sequences
• The electrical resistance of a graph captures its commute and cover times
• Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)).
• On the cover time of random walks on graphs
• Lower bounds on universal traversal sequences based on chains of length five
• Bounds on Universal Sequences
• Space Lower Bounds for Maze Threadability on Restricted Machines
• Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs

This page was built for publication: Length lower bounds for reflecting sequences and universal traversal sequences