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 K. Hartmann, Martin Weigt - arXiv
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections.
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 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.
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.