Essential Graph Theory
Concepts and Algorithms
- Publisher's listprice GBP 55.00
-
26 276 Ft (25 025 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 2 628 Ft off)
- Discounted price 23 649 Ft (22 523 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
26 276 Ft
Availability
Not yet published.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 31 October 2025
- ISBN 9781009559379
- Binding Paperback
- No. of pages334 pages
- Size 240x182x13 mm
- Weight 468 g
- Language English 700
Categories
Short description:
This textbook is meant for mathematics, computer science, and engineering undergraduates pursuing studies in graph theory and algorithms.
MoreLong description:
Designed for undergraduate students of computer science, mathematics, and engineering, this book provides the tools and understanding needed to master graph theory and algorithms. It offers a strong theoretical foundation, detailed pseudocodes, and a range of real-world and illustrative examples to bridge the gap between abstract concepts and practical applications. Clear explanations and chapter-wise exercises support ease of comprehension for learners. The text begins with the basic properties of graphs and progresses to topics such as trees, connectivity, and distances in graphs. It also covers Eulerian and Hamiltonian graphs, matchings, planar graphs, and graph colouring. The book concludes with discussions on independent sets, the Ramsey theorem, directed graphs and networks. Concepts are introduced in a structured manner, with appropriate context and support from mathematical language and diagrams. Algorithms are explained through rules, reasoning, pseudocode, and relevant examples.
MoreTable of Contents:
Preface; 1. Introduction to graphs; 2. Basic properties of graphs; 3. Trees; 4. Connectivity; 5. Distance in Graphs; 6. Eulerian graphs and Hamiltonian graphs; 7. Matchings; 8. Planar graphs; 9. Coloring of Graphs; 10. Independent sets and Ramsey theory; 11. Directed Graphs; Bibliography; Index.
More
