A characterization for a set of partial partitions to define an X-tree (2002)
AuthorsSemple, C., Steel, M.show all
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 paper, we obtain a related graph-theoretic characterization for the uniqueness of a tree representation of a set of partial partitions of X.
CitationSemple, C., Steel, M. (2002) A characterization for a set of partial partitions to define an X-tree. Discrete Mathematics, 247, pp. 169-186.
This citation is automatically generated and may be unreliable. Use as a guide only.