Sarvanov (15 résultats)

Etat : New. Idioma/Language: Español. *** Nota: Los envíos a España peninsular, Baleares y Canarias se realizan a través de mensajería urgente. No aceptamos pedidos con destino a Ceuta y Melilla.

Etat : New.

Gebunden. Etat : New.

Etat : New. pp. 364.

Etat : Sehr gut. Zustand: Sehr gut | Seiten: 364 | Sprache: Englisch | Produktart: Bücher | 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.…

Etat : New. pp. 364.

Etat : New. Covers the principal branches of graph theory in more than a thousand exercises of varying complexity. This work includes topics such as trees, independence and coverings, matchings, tours, planarity, colourings, degree sequences, connectivity, digraphs and hypergraphs. It is suitable for researchers, lecturers and graduate students. Series: Texts in the Mathematical Sciences. Num Pages: 356 pages, biography. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 20. Weight in Grams: 686. . 1998. Hardback. . . . .…

Paperback. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Etat : New. Covers the principal branches of graph theory in more than a thousand exercises of varying complexity. This work includes topics such as trees, independence and coverings, matchings, tours, planarity, colourings, degree sequences, connectivity, digraphs and hypergraphs. It is suitable for researchers, lecturers and graduate students. Series: Texts in the Mathematical Sciences. Num Pages: 356 pages, biography. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 20. Weight in Grams: 686. . 1998. Hardback. . . . . Books ship from the US and Ireland.…

Hardcover. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Hardcover. Etat : Good. In Russian. Sarvanov, Vladimir Ivanovich. On polyhedra, connected with optimization on wildcards. Minsk: 1977. All images are for identification of editions only. Several books of the same edition may be available. Please feel free to request photos of available books.SKU7694331.…

Etat : New. Print on Demand pp. 364 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Etat : New. PRINT ON DEMAND pp. 364.

Etat : New. Print on Demand pp. 364 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Etat : New. PRINT ON DEMAND pp. 364.