1 paper
Siddharth Bhaskar, Anton Jay Kienzle
A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-fi…