Digraphs: Theory, Algorithms and Applications
by Jorgen Bang-Jensen, Gregory Gutin
Publisher: Springer 2002
Number of pages: 772
The study of directed graphs has developed enormously over recent decades, yet no book covers more than a tiny fraction of the results from more than 3000 research articles on the topic. Digraphs is the first book to present a unified and comprehensive survey of the subject. In addition to covering the theoretical aspects, including detailed proofs of many important results, the authors present a number of algorithms and applications. The applications of digraphs and their generalizations include among other things recent developments in the Travelling Salesman Problem, genetics and network connectivity. More than 700 exercises and 180 figures will help readers to study the topic while open problems and conjectures will inspire further research. This book will be essential reading and reference for all graduate students, researchers and professionals in mathematics, operational research, computer science and other areas who are interested in graph theory and its applications.
Home page url
Download or read it online for free here:
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.
by Alexander K. Hartmann, Martin Weigt - arXiv
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections.
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.