| 000 | 02922nam a22005055i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-47504-7 | ||
| 003 | DE-He213 | ||
| 005 | 20251030111744.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 240325s2024 sz | s |||| 0|eng d | ||
| 020 |
_a9783031475047 _9978-3-031-47504-7 |
||
| 024 | 7 |
_a10.1007/978-3-031-47504-7 _2doi |
|
| 050 | 4 | _aQA166-166.247 | |
| 072 | 7 |
_aPBV _2bicssc |
|
| 072 | 7 |
_aMAT008000 _2bisacsh |
|
| 072 | 7 |
_aPBV _2thema |
|
| 100 | 1 |
_aLucchesi, Cláudio L. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _973954 |
|
| 245 | 1 | 0 |
_aPerfect Matchings _h[electronic resource] : _bA Theory of Matching Covered Graphs / _cby Cláudio L. Lucchesi, U.S.R. Murty. |
| 250 | _a1st ed. 2024. | ||
| 264 | 1 |
_aCham : _bSpringer Nature Switzerland : _bImprint: Springer, _c2024. |
|
| 300 |
_aXXIII, 580 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aAlgorithms and Computation in Mathematics, _x2512-3254 ; _v31 |
|
| 505 | 0 | _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 | 0 | _aGraph theory. | |
| 650 | 1 | 4 | _aGraph Theory. |
| 700 | 1 |
_aMurty, U.S.R. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _973955 |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031475030 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031475054 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031475061 |
| 830 | 0 |
_aAlgorithms and Computation in Mathematics, _x2512-3254 ; _v31 _973956 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-47504-7 |
| 912 | _aZDB-2-SMA | ||
| 912 | _aZDB-2-SXMS | ||
| 999 |
_c58643 _d58643 |
||