Perfect Matchings A Theory of Matching Covered Graphs /
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 w...
Gardado en:
| Main Authors: | , |
|---|---|
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | inglés |
| Publicado: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2024.
|
| Edición: | 1st ed. 2024. |
| Series: | Algorithms and Computation in Mathematics,
31 |
| Subjects: | |
| Acceso en liña: | https://doi.org/10.1007/978-3-031-47504-7 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-47504-7 | ||
| 003 | DE-He213 | ||
| 005 | 20260810154912.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 240325s2024 sz | o |||| 0|eng d | ||
| 020 | |a 9783031475047 |9 978-3-031-47504-7 | ||
| 024 | 7 | |a 10.1007/978-3-031-47504-7 |2 doi | |
| 050 | 4 | |a QA166-166.247 | |
| 072 | 7 | |a PBV |2 bicssc | |
| 072 | 7 | |a MAT008000 |2 bisacsh | |
| 072 | 7 | |a PBV |2 thema | |
| 082 | 0 | 4 | |a 511.5 |2 23 |
| 100 | 1 | |a Lucchesi, Cláudio L. |e author. |0 (orcid)0000-0002-7865-8086 |1 https://orcid.org/0000-0002-7865-8086 |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Perfect Matchings |h [electronic resource] : |b A Theory of Matching Covered Graphs / |c by Cláudio L. Lucchesi, U.S.R. Murty. |
| 250 | |a 1st ed. 2024. | ||
| 264 | 1 | |a Cham : |b Springer Nature Switzerland : |b Imprint: Springer, |c 2024. | |
| 300 | |a 1 online resource (XXIII, 580 p.). | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Algorithms and Computation in Mathematics, |x 2512-3254 ; |v 31 | |
| 505 | 0 | |a 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. | |
| 520 | |a 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. | ||
| 588 | |a Print version record. | ||
| 650 | 0 | |a Graph theory. | |
| 650 | 1 | 4 | |a Graph Theory. |
| 700 | 1 | |a Murty, U.S.R. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783031475030 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031475054 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031475061 |
| 830 | 0 | |a Algorithms and Computation in Mathematics, |x 2512-3254 ; |v 31 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-47504-7 |
| 912 | |a ZDB-2-SMA | ||
| 912 | |a ZDB-2-SXMS | ||
| 950 | |a Mathematics and Statistics (SpringerNature-11649) | ||
| 950 | |a Mathematics and Statistics (R0) (SpringerNature-43713) | ||