1 option
Perfect Matchings : A Theory of Matching Covered Graphs / by Cláudio L. Lucchesi, U.S.R. Murty.
Springer Nature - Springer Mathematics and Statistics eBooks 2024 English International Available online
View online- Format:
- Book
- Author/Creator:
- Lucchesi, Cláudio L., author.
- Murty, U. S. R., author.
- Series:
- Algorithms and Computation in Mathematics, 2512-3254 ; 31
- Language:
- English
- Subjects (All):
- Graph theory.
- Graph Theory.
- Local Subjects:
- Graph Theory.
- Physical Description:
- 1 online resource (584 pages)
- Edition:
- 1st ed. 2024.
- Place of Publication:
- Cham : Springer Nature Switzerland : Imprint: Springer, 2024.
- Summary:
- 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.
- Contents:
- 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.
- Notes:
- Includes bibliographical references and index.
- ISBN:
- 9783031475047
- 3031475046
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.