Enumerating consecutive and nested partitions for graphs
| dc.citation.epage | 70 | en_US |
| dc.citation.issue | 1 | en_US |
| dc.citation.spage | 63 | en_US |
| dc.citation.volume | 19 | en_US |
| dc.contributor.author | Hwang, FK | en_US |
| dc.contributor.author | Chang, GJ | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:01:13Z | |
| dc.date.available | 2014-12-08T15:01:13Z | |
| dc.date.issued | 1998-01-01 | en_US |
| dc.description.abstract | Consecutive and nested partitions have been extensively studied in the set-partition problem as tools with which to search efficiently for an optimal partition. We extend the study of consecutive and nested partitions on a set of integers to the vertex-set of a graph. A subset of vertices is considered consecutive if the subgraph induced by the subset is connected. In this sense the partition problem on a set of integers can be treated as a special case when the graph is a line. In this paper we give the number of consecutive and nested partitions when the graph is a cycle. We also give a partial order on general graphs with respect to these numbers. (C) 1998 Academic Press Limited. | en_US |
| dc.identifier.issn | 0195-6698 | en_US |
| dc.identifier.journal | EUROPEAN JOURNAL OF COMBINATORICS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/114 | |
| dc.language.iso | en_US | en_US |
| dc.title | Enumerating consecutive and nested partitions for graphs | en_US |
| dc.type | Article | en_US |