000			01692 a2200253 4500
008			241224b2024 |||||||| |||| 00| 0 eng d
020			_a9783031475030 (HB)
041			_aeng
080			_a519.178 _bLUC
100			_aLucchesi , Claudio L.
245			_aPerfect matchings _b: A theory of matching covered graphs
260			_bSpringer _c2024 _aSwitzerland
300			_axxiii, 580p.
490			_aAlgorithms and computation in mathematics _vVol. 31
500			_aIncludes index
504			_aIncludes reference
505			_aPart I. Basic Theory Part II Brick and Brace Generation Part III Pfaffian Orientations A. Solutions to Selected Exercises References List of Figures Glossary Index
520			_aBeginning 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
650			_aperfect matchings
650			_aGraph
690			_aMathematics
700			_aMurty, U. S. R.
942			_cBK
999			_c60632 _d60632