A characterization for a set of partial partitions to define an X-tree
| dc.contributor.author | Semple, Charles | |
| dc.contributor.author | Steel, M. A. | |
| dc.date.accessioned | 2016-08-31T02:37:43Z | |
| dc.date.available | 2016-08-31T02:37:43Z | |
| dc.date.issued | 1999 | en |
| dc.description.abstract | 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. | en |
| dc.identifier.issn | 1172-8531 | |
| dc.identifier.uri | http://hdl.handle.net/10092/12658 | |
| dc.language.iso | en | |
| dc.publisher | University of Canterbury | en |
| dc.rights | All Rights Reserved | en |
| dc.rights.uri | https://canterbury.libguides.com/rights/theses | |
| dc.subject.anzsrc | Fields of Research::49 - Mathematical sciences::4904 - Pure mathematics::490401 - Algebra and number theory | en |
| dc.title | A characterization for a set of partial partitions to define an X-tree | en |
| dc.type | Discussion / Working Papers | |
| uc.college | Faculty of Engineering | |
| uc.department | School of Engineering | en |