Perfect matchings : A theory of matching covered graphs

By: Lucchesi , Claudio LContributor(s): Murty, U. S. RLanguage: English Series: Algorithms and computation in mathematics ; Vol. 31Publication details: Switzerland Springer 2024Description: xxiii, 580pISBN: 9783031475030 (HB)Subject(s): perfect matchings | Graph | Mathematics
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
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
Item type: BOOKS List(s) this item appears in: New Arrivals (01 January 2025)
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified Status Notes Date due Barcode
IMSc Library
IMSc Library
519.178 LUC (Browse shelf (Opens below)) Not for loan New Arrival upto 15 January 2025 78320

Includes index

Includes reference

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

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha