ISBN10: 3411171219, ISBN13: 9783411171217, [publisher: Mannheim ; Leipzig ; Wien ; Zürich : BI-Wiss.-Verl.] Hardcover 371 S. : graph. Darst. ; 25 cm; fadengeh. Orig.-Pappband. Gutes Ex. - Englisch. - Fundamentals of Graph Theory: trees and spanning trees, independence and coverings, matchings, tours, planarity, colorings, degree sequences, connectivity, digraphs, hypergraphs are exposed in the book. An el-ementary selfcontained treatment of the ABC of Matroid Theory specially suited for the needs of Graph Theory is given. The notion of a polynomial algorithm is introduced. An introduction to NP-completeness is included. Well known unsolved problems of Graph Theory are pointed out. Some examples of the reduction of applied problems to those of Graph Theory are given. Each chapter is accompanied by exercises. The book can be used as a principal textbook on Graph Theory accessible to beginners. It will also be useful to specialists since the treatment reaches recent results which earlier could be found in original papers only. (Verlagstext) / INHALT : . The Problems of Clique, Isomorphic Embedding, and Isomorphic Subgraph --- Interpretations of Independent Sets --- Matchings in Graphs --- Matchings in Bipartite Graphs --- Bipartite Graphs and Collections of Subsets --- Matchings and Coverings --- Exercises to Chapter IV --- V Connectivity --- Vertex Connectivity and Edge Connectivity --- Biconnected Graphs --- Menger Theorem --- Exercises to Chapter V --- VI Planarity - ...
Show/Hide image

ISBN10: 3411171219, ISBN13: 9783411171217, [publisher: Mannheim ; Leipzig ; Wien ; Zürich : BI-Wiss.-Verl.] Hardcover 371 S. : graph. Darst. ; 25 cm; fadengeh. Orig.-Pappband. Gutes Ex. - Englisch. - Fundamentals of Graph Theory: trees and spanning trees, independence and coverings, matchings, tours, planarity, colorings, degree sequences, connectivity, digraphs, hypergraphs are exposed in the book. An el-ementary selfcontained treatment of the ABC of Matroid Theory specially suited for the needs of Graph Theory is given. The notion of a polynomial algorithm is introduced. An introduction to NP-completeness is included. Well known unsolved problems of Graph Theory are pointed out. Some examples of the reduction of applied problems to those of Graph Theory are given. Each chapter is accompanied by exercises. The book can be used as a principal textbook on Graph Theory accessible to beginners. It will also be useful to specialists since the treatment reaches recent results which earlier could be found in original papers only. (Verlagstext) / INHALT : . The Problems of Clique, Isomorphic Embedding, and Isomorphic Subgraph --- Interpretations of Independent Sets --- Matchings in Graphs --- Matchings in Bipartite Graphs --- Bipartite Graphs and Collections of Subsets --- Matchings and Coverings --- Exercises to Chapter IV --- V Connectivity --- Vertex Connectivity and Edge Connectivity --- Biconnected Graphs --- Menger Theorem --- Exercises to Chapter V --- VI Planarity - ...
Show/Hide image

ISBN10: 3411171219, ISBN13: 9783411171217, [publisher: The Institute of Fundamental Research] Hardcover Buy with confidence! Book is in good condition with minor wear to the pages, binding, and minor marks within 1.63
[Amherst, NY, U.S.A.] [Publication Year: 1967]