Dependence Classes in Bricks
摘要
We continue our study of dependence classes in matching covered graphs. But here our attention is mainly devoted to bricks. We have seen that, in general, dependence classes in matching covered graphs can be arbitrarily large (see Figure 8.10), although no removable class can havemore than two edges (Corollary 8.18).