Generalized activities and \(K\)-terminal reliability. II (Q1343280)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalized activities and \(K\)-terminal reliability. II |
scientific article; zbMATH DE number 716473
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized activities and \(K\)-terminal reliability. II |
scientific article; zbMATH DE number 716473 |
Statements
Generalized activities and \(K\)-terminal reliability. II (English)
0 references
1 February 1995
0 references
[For Part I see ibid. 96, No. 2, 131-149 (1991; Zbl 0752.05054).] Tutte's description of the (di)chromatic polynomial of a graph in terms of activities with respect to maximal forests gives rise to a partition of the power set of the edge set as a collection of intervals, one corresponding to each maximal forest. This partition is useful in producing simplified expressions of all-terminal reliability. This paper compares two similar partitions connected with \(K\)-terminal reliability, one due to the author and the other due to Colbourn and Pulleyblank.
0 references
chromatic polynomial
0 references
activities
0 references
partition
0 references
maximal forest
0 references
\(K\)-terminal reliability
0 references
