Graph traversal algorithms like breadth-first search and depth-first search typically produce an ordering of the vertices of the input graph. Properties of these vertex orderings often provide new insights about the ...