Abstract
In this final chapter of Part I, we bring together ideas of bicontractions of vertices of degree two and deletions of removable classes described in the preceding chapters to introduce two closely related types of minors that are specific to the theory of matching covered graphs. They play a role in this subject that is similar to that of the familiar type of minors in graph theory.We consider first the more general of these two types of minors which was introduced by Norine and Thomas (2007, [78]).
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). Matching Minors. In: Perfect Matchings. Algorithms and Computation in Mathematics, vol 31. Springer, Cham. https://doi.org/10.1007/978-3-031-47504-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-47504-7_12
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)