Generalized activities and \(K\)-terminal reliability. II
[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.
scientific article; zbMATH DE number 716473