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 Madhumangal Pal - arXiv
Intersection graphs are important in both theoretical as well as application point of view. Different type of intersection graphs are defined, among them interval, circular-arc, permutation, trapezoid, chordal, disk, circle graphs are more important.
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 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 Christopher P. Mawata - Math Cove
This comprehensive text covers the important elementary topics of graph theory and its applications. It presents a variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics.