東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Perfect matchings = a theory of matching covered graphs /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Perfect matchings/ by Claudio L. Lucchesi, U.S.R. Murty.
其他題名:	a theory of matching covered graphs /
作者:	Lucchesi, Claudio L.
其他作者:	Murty, U. S. R.
出版者:	Cham :Springer Nature Switzerland : : 2024.,
面頁冊數:	xxiii, 580 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Graph theory. -
電子資源:	https://doi.org/10.1007/978-3-031-47504-7
ISBN:	9783031475047

Perfect matchings = a theory of matching covered graphs /
Lucchesi, Claudio L.

Perfect matchingsa theory of matching covered graphs /[electronic resource] :by Claudio L. Lucchesi, U.S.R. Murty. - Cham :Springer Nature Switzerland :2024. - xxiii, 580 p. :ill., digital ;24 cm. - Algorithms and computation in mathematics ;v. 31. - Algorithms and computation in mathematics ;v. 31..

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.

ISBN: 9783031475047

Standard No.: 10.1007/978-3-031-47504-7doiSubjects--Topical Terms:

523815
Graph theory.

LC Class. No.: QA166

Dewey Class. No.: 511.5

Perfect matchings = a theory of matching covered graphs /
LDR:02088nmm a22003375a 4500 001 2370615
003 DE-He213
005 20240327063351.0
006 m d
007 cr nn 008maaau
008 241127s2024 sz s 0 eng d
020 $a 9783031475047 $q (electronic bk.)
020 $a 9783031475030 $q (paper)
024 7 $a 10.1007/978-3-031-47504-7 $2 doi
035 $a 978-3-031-47504-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166
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
090 $a QA166 $b .L934 2024
100 1 $a Lucchesi, Claudio L. $3 1070302
245 1 0 $a Perfect matchings $h [electronic resource] : $b a theory of matching covered graphs / $c by Claudio L. Lucchesi, U.S.R. Murty.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a xxiii, 580 p. : $b ill., digital ; $c 24 cm.
490 1 $a Algorithms and computation in mathematics ; $v 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.
650 0 $a Graph theory. $3 523815
650 1 4 $a Graph Theory. $3 1567033
700 1 $a Murty, U. S. R. $3 636685
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Algorithms and computation in mathematics ; $v v. 31. $3 3716099
856 4 0 $u https://doi.org/10.1007/978-3-031-47504-7
950 $a Mathematics and Statistics (SpringerNature-11649)