A characterization for a set of partial partitions to define an X-tree


Trees whose vertices are partially labelled by elements of a finite set X provide a natural way to represent partitions of subsets of X. The condition under which a given collection of such partial partitions of X can be represented by a tree has previously been characterized in terms of a chordal graph structure on an underlying intersection graph. In this… (More)
DOI: 10.1016/S0012-365X(01)00174-1


3 Figures and Tables