Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Exercises in Graph Theory

Name: Exercises in Graph Theory
Brand: Springer
SKU: 01395610
Price: 83793 HUF
Availability: InStock
Author: Oleg Melnikov
ISBN: 9780792349068

Language

English

Book Hardback

Libristo code: 01395610

Publishers Springer, March 1998

This volume covers the principal branches of graph theory in more than a thousand exercises of varyi... Full description

Libristo code: 01395610

560 b

83 793 Ft

In stock at our supplier Shipping in 10-13 days

Up to 30 days for returns

Customers also purchased

Tintin21 : Vol 714 pour Sydney, petit format(éd. 2009) | Tintin 21: 714 Hangban (Version chinoise) Hergé

Paperback

3 936 Ft

MIMO MATEMATICAS 2 EDUCACION PRIMARIA CUAD

Paperback

4 743 Ft

Walden

Audio CD

8 603 Ft

Monty Python a Svatý grál Monty Python

Hardback

2 336 Ft

Schrei der Nachtigall Andreas Franz

Paperback

5 550 Ft

Briefe Georg Chr. Lichtenberg

Paperback

4 894 Ft

Maluszkowe malowanie Dinozaury praca zbiorowa

Paperback

194 Ft

Obal na knihu se zipem K64 Červený

Stationery items

16 475 Ft

Les -123 minut

Audio CD

3 889 Ft

Die Tagesgoetter in Rom und den Provinzen Ernst Maass

Paperback

7 197 Ft

Souvenirs de jeunesse 1939 - 1945 Paul Kalt

Paperback

2 440 Ft

MÜNCHEN und seine Bauten Architekten- und Ingenieurverein Bayern

Paperback

16 117 Ft

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.