Minimal obstructions for tree-depth: A non-1-unique example

Michael D. Barrus, John Sinkovic

A k-ranking of a graph G is a labeling of the vertices of G with values from 1,...,k such that any path joining two vertices with the same label contains a vertex having a higher l…