圖論 pdf epub mobi txt 電子書 下載2025

想要找書就要到 小美書屋

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

本書並不是一本論文集，而是一係列講稿的有機組閤。本書涉及瞭Menger定理、重構、矩陣—樹定理、Brooks定理、Grinberg定理、平麵圖等核心論題。在講述時不僅關注原理本身，而且關注其推導過程。如果想對圖論有個基本的瞭解，本書是最佳選擇。另外，書中每一章都附有習題、注記和詳盡的參考文獻。

“相信本書會對在堅實的理論與技術基礎上搭建起圖論的大廈起到十分重要的作用。”

——Crispin St.J.A. Nash-Williams教授，裏丁大學

W．T．Tutte已故著名數學傢，現代圖論奠基人之一。他於1948年獲得劍橋大學博士學位；1942年至1949年擔任三一學院評論員；1948年至1962年執教於多倫多大學。他是加拿大皇傢科學院院士，曾被授予HenryMarshallTory奬。1982年，加拿大議會授予他IzaakWaltonKillam紀念奬。除本書外，他還著有擬陣論方麵的書籍。他生前還多年擔任《Journal of Combinatorial Theory》雜誌主編。

Editor's Statement
Foreword
Introduction
Chapter I Graphs and Subgraphs
I.1 Definitions
1.2 Isomorphism
1.3 Subgraphs
1.4 Vertices of attachment
1.5 Components and connection
1.6 Deletion of an edge
1.7 Lists of nonisomorphic connected graphs
1.8 Bridges
1.9 Notes
Exercises
References
Chapter II Contractions and the Theorem of Menger
II.1 Contractions
II.2 Contraction of an edge
II.3 Vertices of attachment
II.4 Separation numbers
II.5 Menger's Theorem
II.6 Hall's Theorem
II.7 Notes
Exercises
References
Chapter III 2-Connection
III.1 Separable and 2-connected graphs
III.2 Constructions for 2-connected graphs
III.3 Blocks
III.4 Arms
III.5 Deletion and contraction of an edge
II1.6 Notes
Exercises
References
Chapter IV 3-Connection
IV.1 Multiple connection
IV.2 Some constructions for 3-connected graphs
IV.3 3-blocks
IV.4 Cleavages
IV.5 Deletions and contractions of edges
IV.6 The Wheel Theorem
IV.7 Notes
Exercises
References
Chapter V Reconstruction
V.I The Reconstruction Problem
V.2 Theory and practice
V.3 Kelly's Lemma
V.4 Edge-reconstruction
V.5 Notes
Exercises
References
Chapter VI Digraphs and Paths
VI.1 Digraphs
VI.2 Paths
VI.3 The BEST Theorem
VI.4 The Matrix-Tree Theorem
VI.5 The Laws of Kirchhoff
VI.6 Identification of vertices
VI.7 Transportation Theory
VI.8 Notes
Exercises
References
Chapter VII Alternating Paths
VII.1 Cursality
VII.2 The bicursal subgraph
VII.3 Bicursal units
VII.4 Alternating barriers
VII.5 f-factors and f-barriers
VII.6 The f-factor theorem
VII.7 Subgraphs of minimum deficiency
VII.8 The bipartite case
VII.9 A theorem of Erdos and Gallai
VII.10 Notes
Exercises
References
Chapter VIII Algebraic Duality
VIII.I Chain-groups
VIII.2 Primitive chains
VIII.3 Regular chain-groups
VIII.4 Cycles
VIII.5 Coboundaries
VIII.6 Reductions and contractions
VIII.7 Algebraic duality
VIII.8 Connectivity
VIII.9 On transportation theory
VIII.10 Incidence matrices
VIII.11 Matroids
VIII.12 Notes
Exercises
References
Chapter IX Polynomials Associated with Graphs
IX.1 V-functions
IX.2 The chromatic polynomial
IX.3 Colorings of graphs
IX.4 The flow polynomial
IX.5 Tait colorings
IX.6 The dichromate of a graph
IX.7 Some remarks on reconstruction
IX.8 Notes
Exercises
References
Chapter X Combinatorial Maps
X.1 Definitions and preliminary theorems
X.2 Orientability
X.3 Duality
X.4 Isomorphism
X.5 Drawings of maps
X.6 Angles
X.7 Operations on maps
X.8 Combinatorial surfaces
X.9 Cycles and coboundaries
X. 10 Notes
Exercises
References
Chapter XI Planarity
XI.1 Planar graphs
XI.2 Spanning subgraphs
XI.3 Jordan's Theorem
XI.4 Connectivity in planar maps
XI.5 The cross-cut Theorem
XI.6 Bridges
XI.7 An algorithm for planarity
XI.8 Peripheral circuits in 3-connected graphs
XI.9 Kuratowski's Theorem
XI.10 Notes
Exercises
References
Index
· · · · · · (收起)