Localizing Combinatorial Properties for Partitions on Block Graphs

被引：1

作者：

Chang G.J. ^{[1
]}

Hwang F.K. ^{[1
]}

Yao Y.C. ^{[2
]}

机构：

[1] Dept. of Applied Mathematics, National Chiao Tung University

[2] Inst. Statistical Science, Academia Sinica, Taipei

来源：

Journal of Combinatorial Optimization | 1998年 / 2卷 / 4期

关键词：

Block graph; Consecutive partition; Nested partition; Order consecutive partition; Partition; Penetration; Tree;

D O I：

10.1023/A:1009730825062

中图分类号：

学科分类号：

摘要：

We extend the study on partition properties from the set partition to the graph partition, especially for the class of connected block graphs which includes trees. We introduce seventeen partition properties and determine their inter-relations. The notions of k-consistency and k-sortability were studied in the set partition to localize the properties, i.e., a global property can be verified through checking local conditions. We carry on these studies for partitions on connected block graphs. In particular, we completely determine the consistency for all the seventeen properties.

引用

页码：429 / 441

页数：12