Committee login






Small thumbnail

Dynamics of Large Structures and Inverse Problems

Mathematical and Mechanical Engineering Set Volume 5

Small thumbnail

Civil Engineering Structures According to the Eurocodes

Small thumbnail

Swelling Concrete in Dams and Hydraulic Structures

DSC 2017

Small thumbnail

Earthquake Occurrence

Short- and Long-term Models and their Validation

Small thumbnail

The Chemostat

Mathematical Theory of Microorganims Cultures

Small thumbnail

From Prognostics and Health Systems Management to Predictive Maintenance 2

Knowledge, Traceability and Decision

Small thumbnail

First Hitting Time Regression Models

Lifetime Data Analysis Based on Underlying Stochastic Processes

Small thumbnail

The Innovative Company

An Ill-defined Object

Small thumbnail

Reading and Writing Knowledge in Scientific Communities

Digital Humanities and Knowledge Construction

Small thumbnail

Going Past Limits To Growth

A Report to the Club of Rome EU-Chapter

Small thumbnail

Graph Theory and Applications

with exercises and problems

Jean-Claude Fournier, University Pierre et Marie Curie, Paris, France

ISBN: 9781848210707

Publication Date: February 2009   Hardback   288 pp.

135.00 USD

Add to cart


Ebook Ebook


This book provides a pedagogical and comprehensive introduction to graph theory and its applications. It contains all the standard basic material and develops significant topics and applications, such as: colorings and the timetabling problem, matchings and the optimal assignment problem, Hamiltonian cycles and the travelling salesman problem, to name but a few.
Exercises at various levels are given at the end of each chapter, and a final chapter presents a few general problems, with hints for solutions, thus providing the reader with the opportunity to test and refine their knowledge on the subject.
An appendix outlines the basis of computational complexity theory, in particular the definition of NP-completeness, which is essential for algorithmic applications.


1. Basic Concepts.
2. Trees.
3. Colorings.
4. Directed Graphs.
5. Search Algorithms.
6. Optimal Paths.
7. Matchings.
8. Flows.
9. Euler Tours.
10. Hamilton Cycles.
11. Planar Representations.
12. Problems with Comments.

About the Authors

Jean-Claude Fournier is Professor at the University of Paris 12, France, and is a member of the Unité Mixte de Recherche Combinatoire et Optimisation (University of Paris 6 and CNRS) founded by Claude Berge.


DownloadTable of Contents - PDF File - 60 Kb

DownloadSample Chapter - PDF File - 333 Kb

Related Titles

0.05015 s.