| Exercises in Graph Theory 1998 Edition Contributor(s): Melnikov, O. (Author), Sarvanov, V. (Author), Tyshkevich, R. I. (Author) |
|
 |
ISBN: 0792349067 ISBN-13: 9780792349068 Publisher: Springer OUR PRICE: $237.49 Product Type: Hardcover - Other Formats Published: March 1998 Annotation: This volume covers the principal branches of graph theory in more than a thousand exercises of varying complexity. Each section starts with the main definitions and a brief theoretical discussion, which will serve as a reminder when solving the problems. Answers and hints are supplied separately. Topics include trees, independence and coverings, matchings, tours, planarity, colourings, degree sequences, connectivity, digraphs and hypergraphs. Audience: This work will be valuable to researchers, lecturers and graduate students in graph theory, combinatorics, VLSI design, circuits and systems, and mathematical programming and optimization. |
| Additional Information |
| BISAC Categories: - Mathematics | Graphic Methods |
| Dewey: 511.507 |
| LCCN: 97046594 |
| Series: Texts in the Mathematical Sciences |
| Physical Information: 0.81" H x 6.14" W x 9.21" (1.51 lbs) 356 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |