R. P. Anstee and M. Farber, Characterization of totally balanced matrices, Journal of Algorithms, vol.5, pp.215-230, 1984.

H. Bandelt and W. M. Dress, Weak hierarchies associated with similarity measures -an additive clustering technique, Bulletin of Mathematical Biology, vol.51, pp.133-166, 1989.

P. Bertrand, Set systems and dissimilarities, European Journal of Combinatorics, vol.21, pp.727-743, 2000.

F. Brucker and A. Gély, Crown-free lattices and their related graphs, Order, vol.28, pp.443-454, 2011.

F. Brucker and P. Préa, Totally balanced formal concept representations, Proceedings of ICFCA 2015, pp.169-182, 2015.

M. Dien, Concurrent process and combinatorics of increasingly labeled structures: quantitative analysis and random generation algorithms, 2017.
URL : https://hal.archives-ouvertes.fr/tel-01678893

M. Farber, Characterizations of strongly chordal graphs, Discrete Mathematics, vol.43, pp.173-189, 1983.

J. Diatta and B. Fichet, From asprejan hierarchies and bandelt-dress weak hierarchies to quasihierarchies, New Approaches in classification and data analysis, pp.111-118, 1994.

J. Lehel, Characterization of totally balanced hypergraphs, Discrete Mathematics, vol.57, pp.59-65, 1985.

L. Lovász, Graphs and set systems, Beiträge zur Graphentheorie, vol.57, pp.99-106, 1968.

J. Spinrad, Efficient Graph representations, 2003.