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 Russell Lyons, Yuval Peres - Cambridge University Press
This book is concerned with certain aspects of discrete probability on infinite graphs that are currently in vigorous development. Of course, finite graphs are analyzed as well, but usually with the aim of understanding infinite graphs and networks.
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 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 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.