**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

**Lecture Notes on Graph Theory**

by

**Tero Harju**-

**University of Turku**

These are introductory lecture notes on graph theory. Contents: Introduction (Graphs and their plane figures, Subgraphs, Paths and cycles); Connectivity of Graphs; Tours and Matchings; Colourings; Graphs on Surfaces; Directed Graphs.

(

**10518**views)

**Intersection Graphs: An Introduction**

by

**Madhumangal Pal**-

**arXiv**

Intersection graphs are important in both theoretical as well as application point of view. Different type of intersection graphs are defined, among them interval, circular-arc, permutation, trapezoid, chordal, disk, circle graphs are more important.

(

**3587**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.

(

**9523**views)

**Probability on Trees and Networks**

by

**Russell Lyons, Yuval Peres**-

**Cambridge University Press**

This book is concerned with certain aspects of discrete probability on infinite graphs that are currently in vigorous development. Of course, finite graphs are analyzed as well, but usually with the aim of understanding infinite graphs and networks.

(

**1922**views)