02922nam a22005055i 4500 978-3-031-47504-7 DE-He213 20251030111744.0 cr nn 008mamaa 240325s2024 sz | s |||| 0|eng d 9783031475047 978-3-031-47504-7 10.1007/978-3-031-47504-7 doi QA166-166.247 PBV bicssc MAT008000 bisacsh PBV thema Lucchesi, Cláudio L. author. aut http://id.loc.gov/vocabulary/relators/aut 73954 Perfect Matchings [electronic resource] : A Theory of Matching Covered Graphs / by Cláudio L. Lucchesi, U.S.R. Murty. 1st ed. 2024. Cham : Springer Nature Switzerland : Imprint: Springer, 2024. XXIII, 580 p. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Algorithms and Computation in Mathematics, 2512-3254 ; 31 Part I. Basic Theory -- Part II -- Brick and Brace Generation -- Part III -- Pfaffian Orientations -- A. Solutions to Selected Exercises -- References -- List of Figures -- Glossary -- Index. Beginning with its origins in the pioneering work of W.T. Tutte in 1947, this monograph systematically traces through some of the impressive developments in matching theory. A graph is matchable if it has a perfect matching. A matching covered graph is a connected graph on at least two vertices in which each edge is covered by some perfect matching. The theory of matching covered graphs, though of relatively recent vintage, has an array of interesting results with elegant proofs, several surprising applications and challenging unsolved problems. The aim of this book is to present the material in a well-organized manner with plenty of examples and illustrations so as to make it accessible to undergraduates, and also to unify the existing theory and point out new avenues to explore so as to make it attractive to graduate students. Graph theory. Graph Theory. Murty, U.S.R. author. aut http://id.loc.gov/vocabulary/relators/aut 73955 SpringerLink (Online service) Springer Nature eBook Printed edition: 9783031475030 Printed edition: 9783031475054 Printed edition: 9783031475061 Algorithms and Computation in Mathematics, 2512-3254 ; 31 73956 https://doi.org/10.1007/978-3-031-47504-7 ZDB-2-SMA ZDB-2-SXMS 58643 58643