T-Robinson Spaces: Structure, Recognition, and Applications to Real Data
A complete combinatorial characterization of Robinson spaces is established by proving their equivalence with several graph- and hypergraph-theoretic properties, and it is shown that a dissimilarity space is $T$-Robinson if and only if all its level graphs are dually chordal with a common compatible tree.