**Advanced Graph Theory and Combinatorial Optimization**

by Alexander Schrijver

2012**Number of pages**: 64

**Description**:

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.

Download or read it online for free here:

**Download link**

(430KB,PDF)

## Similar books

**Probability on Trees and Networks**

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.

(

**5845**views)

**An Introduction to Combinatorics and Graph Theory**

by

**David Guichard**-

**Whitman College**

The book covers the classic parts of Combinatorics and graph theory, with some recent progress in the area. Contents: Fundamentals; Inclusion-Exclusion; Generating Functions; Systems of Distinct Representatives; Graph Theory; Polya-Redfield Counting.

(

**7770**views)

**Graph Theory**

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.

(

**19693**views)

**Advances in Graph Algorithms**

by

**Ton Kloks, Yue-Li Wang**-

**viXra.org**

This is a book about some currently popular topics such as exponential algorithms, fixed-parameter algorithms and algorithms using decomposition trees of graphs. For this last topic we found it necessary to include a chapter on graph classes.

(

**7810**views)