Graph Theory
by Reinhard Diestel
Publisher: Springer 2005
ISBN/ASIN: 3540261834
ISBN-13: 9783540261834
Number of pages: 422
Description:
The third edition of this standard textbook of modern graph theory has been carefully revised, updated, and substantially extended. Covering all its major recent developments it can be used both as a reliable textbook for an introductory course and as a graduate text: on each topic it covers all the basic material in full detail, and adds one or two deeper results (again with detailed proofs) to illustrate the more advanced methods of that field.
Download or read it online for free here:
Download link
(multiple PDF files)
Similar books
Fractional Graph Theory: A Rational Approach to the Theory of Graphs
by Daniel Ullman, Edward Scheinerman - Wiley
In this book the authors explore generalizations of core graph theory notions by allowing real values to substitute where normally only integers would be permitted. The aim is to prove fractional analogues of the theorems of traditional graph theory.
(12154 views)
by Daniel Ullman, Edward Scheinerman - Wiley
In this book the authors explore generalizations of core graph theory notions by allowing real values to substitute where normally only integers would be permitted. The aim is to prove fractional analogues of the theorems of traditional graph theory.
(12154 views)
Advances in Graph Algorithms
by Ton Kloks, Yue-Li Wang - viXra.org
This is a book about some currently popular topics such as exponential algorithms, fixed-parameter algorithms and algorithms using decomposition trees of graphs. For this last topic we found it necessary to include a chapter on graph classes.
(7870 views)
by Ton Kloks, Yue-Li Wang - viXra.org
This is a book about some currently popular topics such as exponential algorithms, fixed-parameter algorithms and algorithms using decomposition trees of graphs. For this last topic we found it necessary to include a chapter on graph classes.
(7870 views)
Advanced Graph Theory and Combinatorial Optimization
by Alexander Schrijver
From the table of contents: Shortest trees and branchings; Matchings and covers; Edge-colouring; Multicommodity flows and disjoint paths; Matroids; Perfect matchings in regular bipartite graphs; Minimum circulation of railway stock.
(10931 views)
by Alexander Schrijver
From the table of contents: Shortest trees and branchings; Matchings and covers; Edge-colouring; Multicommodity flows and disjoint paths; Matroids; Perfect matchings in regular bipartite graphs; Minimum circulation of railway stock.
(10931 views)
Algorithmic Graph Theory
by David Joyner, Minh Van Nguyen, Nathann Cohen - Google Code
An introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source software. The text covers graph algorithms, trees and forests, distance and connectivity, optimal graph traversals, planar graphs, etc.
(15324 views)
by David Joyner, Minh Van Nguyen, Nathann Cohen - Google Code
An introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source software. The text covers graph algorithms, trees and forests, distance and connectivity, optimal graph traversals, planar graphs, etc.
(15324 views)