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 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.
by Jorgen Bang-Jensen, Gregory Gutin - Springer
Digraphs presents a comprehensive survey of the study of directed graphs. It covers theoretical aspects with detailed proofs, and some algorithms and applications. The essential textbook and reference for graduate students and researchers.
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.
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.