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 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 David Guichard - Whitman College
The book covers the classic parts of Combinatorics and graph theory, with some recent progress in the area. Contents: Fundamentals; Inclusion-Exclusion; Generating Functions; Systems of Distinct Representatives; Graph Theory; Polya-Redfield Counting.
Contents: Introduction; The Basics; Tree; Multigraph; Extremal graph theory; Graph Traversal; Analysis; Example Applications of Graph Theory; Travelling salesman problem; Route inspection problem; Hamiltonian path problem; etc.
by Roberto Tamassia (ed.) - CRC Press
The Handbook provides a broad, up-to-date survey of the field of graph drawing. It covers topological and geometric foundations, algorithms, software systems, and visualization applications in business, education, science, and engineering.