02709nam a22004575i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003500137050001800172072001600190072002300206072001500229100009100244245012700335250001800462264006900480300003600549336002600585337002600611338003600637347002400673490006400697505019600761520084500957650001801802650001801820700008201838710003401920773002601954776003601980776003602016776003602052830007102088856004602159912001402205912001502219999001702234978-3-031-47504-7DE-He21320251030111744.0cr nn 008mamaa240325s2024    sz |    s    |||| 0|eng d  a97830314750479978-3-031-47504-77 a10.1007/978-3-031-47504-72doi 4aQA166-166.247 7aPBV2bicssc 7aMAT0080002bisacsh 7aPBV2thema1 aLucchesi, Cláudio L.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut97395410aPerfect Matchingsh[electronic resource] :bA Theory of Matching Covered Graphs /cby Cláudio L. Lucchesi, U.S.R. Murty.  a1st ed. 2024. 1aCham :bSpringer Nature Switzerland :bImprint: Springer,c2024.  aXXIII, 580 p.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda1 aAlgorithms and Computation in Mathematics,x2512-3254 ;v310 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.  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. 0aGraph theory.14aGraph Theory.1 aMurty, U.S.R.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut9739552 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z978303147503008iPrinted edition:z978303147505408iPrinted edition:z9783031475061 0aAlgorithms and Computation in Mathematics,x2512-3254 ;v3197395640uhttps://doi.org/10.1007/978-3-031-47504-7  aZDB-2-SMA  aZDB-2-SXMS  c58643d58643