共 50 条
A characterization for a set of partial partitions to define an X-tree
被引:11
|作者:
Semple, C
[1
]
Steel, M
[1
]
机构:
[1] Univ Canterbury, Dept Math & Stat, Christchurch, New Zealand
关键词:
X-trees;
chordal graphs;
partition iniersection graphs;
free X-trees;
D O I:
10.1016/S0012-365X(01)00174-1
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
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. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:169 / 186
页数:18
相关论文