Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Lucchesi, C.L., Murty, U.S.R. (2024). Dependence Classes in Bricks. In: Perfect Matchings. Algorithms and Computation in Mathematics, vol 31. Springer, Cham. https://doi.org/10.1007/978-3-031-47504-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-031-47504-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-47503-0
Online ISBN: 978-3-031-47504-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)