| 書(shū)目名稱 | Exercises in Graph Theory | | 編輯 | O. Melnikov,V. Sarvanov,I. Zverovich | | 視頻video | http://file.papertrans.cn/319/318517/318517.mp4 | | 叢書(shū)名稱 | Texts in the Mathematical Sciences | | 圖書(shū)封面 |  | | 描述 | 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 | | 出版日期 | Textbook 1998 | | 關(guān)鍵詞 | Graph theory; Hypergraph; Matching; Matchings; Mathematica; VLSI; combinatorics; complexity; graphs; optimiza | | 版次 | 1 | | doi | https://doi.org/10.1007/978-94-017-1514-0 | | isbn_softcover | 978-90-481-4979-7 | | isbn_ebook | 978-94-017-1514-0Series ISSN 0927-4529 | | issn_series | 0927-4529 | | copyright | Springer Science+Business Media B.V., part of Springer Nature 1998 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-13 18:00
發(fā)表于 2025-3-21 18:43:52
