Canonical Partitions
摘要
A barrier B in a matchable graph G is maximal if there is no other barrier of G that properly contains B . The barrier B = { u1, u2, u3} in the graph shown in Figure 2.1 is not maximal because there are barriers of the graph which properly contain B. It can be verified that { v1, u1, u2, u3, u4, u5} is a maximal barrier of that graph.