by Reinhard Diestel
Publisher: Springer 2005
Number of pages: 422
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.
Home page url
Download or read it online for free here:
(multiple PDF files)
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.
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.
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.
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.