On 1-uniqueness and dense critical graphs for tree-depth

Michael D. Barrus, John Sinkovic

The tree-depth of $G$ is the smallest value of $k$ for which a labeling of the vertices of $G$ with elements from $\{1,\dots ,k\}$ exists such that any path joining two vertices wit…