Localizing combinatorial properties for partitions on block graphs

檔案

日期

1999

類型

期刊名稱

JOURNAL OF COMBINATORIAL OPTIMIZATION

卷期與頁次

第 2 卷第 4 期,頁 429–441

ISSN

1382-6905

語言

英文

摘要

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 an the seventeen properties.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chang, G., Hwang, F., & Yao, Y. (1999). Localizing combinatorial properties for partitions on block graphs. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2(4), 429–441. https://ir.lib.nycu.edu.tw/handle/11536/31623

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31623