Algorithmic Graph Theory
by David Joyner, Minh Van Nguyen, Nathann Cohen
Publisher: Google Code 2010
Number of pages: 105
This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software. Contents: Introduction to Graph Theory; Graph Algorithms; Trees and Forests; Distance and Connectivity; Optimal Graph Traversals; Planar Graphs; Graph Coloring; Network Flows; Random Graphs; Graph Problems and Their LP Formulations.
Home page url
Download or read it online for free here:
by Keijo Ruohonen - Tampere University of Technology
These lecture notes form the base text for a Graph Theory course. The text contains an introduction to basic concepts and results in graph theory, with a special emphasis put on the network-theoretic circuit-cut dualism.
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.
by J.A. Bondy and U.S.R. Murty - Elsevier Science Ltd
A coherent introduction to graph theory, a textbook for advanced undergraduates or graduates in computer science and mathematics. A systematic treatment of the theory of graphs, Common proofs are described and illustrated with lots of exercises.
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.