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 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 Reinhard Diestel - Springer
Textbook on graph theory that covers the basics, matching, connectivity, planar graphs, colouring, flows, substructures in sparse graphs, Ramsey theory for graphs, hamiltonian cycles, random graphs, minors, trees, and WQO.
by Beril Sirmacek (ed.) - InTech
Not only will the methods and explanations help you to understand more about graph theory, but you will find it joyful to discover ways that you can apply graph theory in your scientific field. The very basics are not explained at the beginner level.
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.