Advances in Graph Algorithms
by Ton Kloks, Yue-Li Wang
Publisher: viXra.org 2013
Number of pages: 178
This is a book about some currently popular topics such as exponential algorithms, fixed-parameter algorithms and algorithms using decomposition trees of graphs. Especially for this last topic we found it necessary to include a chapter on graph classes.
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 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 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.