2010, ISBN: 9048149797

[EAN: 9789048149797], Neubuch, [SC: 0.0], [PU: Springer Netherlands], GRAPHTHEORY; HYPERGRAPH; MATCHING; MATCHINGS; MATHEMATICA; VLSI; COMBINATORICS; COMPLEXITY; GRAPHS; OPTIMIZATION; PRO… Meer...

[EAN: 9789048149797], Neubuch, [SC: 0.0], [PU: Springer Netherlands], GRAPHTHEORY; HYPERGRAPH; MATCHING; MATCHINGS; MATHEMATICA; VLSI; COMBINATORICS; COMPLEXITY; GRAPHS; OPTIMIZATION; PROGRAMMING, Druck auf Anfrage Neuware -This book supplements the textbook of the authors' Lectures on Graph The ory' [6] by more than thousand exercises of varying complexity. The books match each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs. The exercises are grouped into eleven chapters and numerous sections accord ing to the topics of graph theory: paths, cycles, components, subgraphs, re constructibility, operations on graphs, graphs and matrices, trees, independence, matchings, coverings, connectivity, matroids, planarity, Eulerian and Hamiltonian graphs, degree sequences, colorings, digraphs, hypergraphs. Each section starts with main definitions and brief theoretical discussions. They constitute a minimal background, just a reminder, for solving the exercises. the presented facts and a more extended exposition may be found in Proofs of the mentioned textbook of the authors, as well as in many other books in graph theory. Most exercises are supplied with answers and hints. In many cases complete solutions are given. At the end of the book you may find the index of terms and the glossary of notations. The 'Bibliography' list refers only to the books used by the authors during the preparation of the exercisebook. Clearly, it mentions only a fraction of available books in graph theory. The invention of the authors was also driven by numerous journal articles, which are impossible to list here. 364 pp. Englisch, Books<

ISBN: 9789048149797

This book supplements the textbook of the authors"" Lectures on Graph The­ ory"" [6] by more than thousand exercises of varying complexity. The books match each other in their contents, … Meer...

This book supplements the textbook of the authors"" Lectures on Graph The­ ory"" [6] by more than thousand exercises of varying complexity. The books match each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs. The exercises are grouped into eleven chapters and numerous sections accord­ ing to the topics of graph theory: paths, cycles, components, subgraphs, re­ constructibility, operations on graphs, graphs and matrices, trees, independence, matchings, coverings, connectivity, matroids, planarity, Eulerian and Hamiltonian graphs, degree sequences, colorings, digraphs, hypergraphs. Each section starts with main definitions and brief theoretical discussions. They constitute a minimal background, just a reminder, for solving the exercises. the presented facts and a more extended exposition may be found in Proofs of the mentioned textbook of the authors, as well as in many other books in graph theory. Most exercises are supplied with answers and hints. In many cases complete solutions are given. At the end of the book you may find the index of terms and the glossary of notations. The ""Bibliography"" list refers only to the books used by the authors during the preparation of the exercisebook. Clearly, it mentions only a fraction of available books in graph theory. The invention of the authors was also driven by numerous journal articles, which are impossible to list here. | Exercises in Graph Theory by O. Melnikov Paperback | Indigo Chapters Books > Science & Nature > Science > Technology > Superconductors P10117, O. Melnikov<

2010, ISBN: 9048149797

Softcover reprint of the original 1st ed. 1998 Kartoniert / Broschiert Diskrete Mathematik, Optimierung, Elektrotechnik, graphtheory; hypergraph; Matching; Matchings; Mathematica; VLSI;… Meer...

Softcover reprint of the original 1st ed. 1998 Kartoniert / Broschiert Diskrete Mathematik, Optimierung, Elektrotechnik, graphtheory; hypergraph; Matching; Matchings; Mathematica; VLSI; combinatorics; complexity; Optimization; programming; graphs, with dust cover 11, [PU:Springer Netherlands; Springer Netherland]<

2010, ISBN: 9789048149797

Paperback, New., Texts in the Mathematical Sciences . VIII, 356 p. Intended for professional and scholarly audience., Dordrecht, [PU: Springer]