By the authors of the classic text, Graph Theory with Applications

Serves as both a textbook and an introduction to graph theory research, suitable for both mathematicians and computer scientists

Features many new exercises of varying levels of difficulty to help the reader master the techniques

An accompanying website/blog at blogs.springer.com/bondyandmurty provides a forum for further discussion and a wealth of supplementary material

By the authors of the classic text, Graph Theory with Applications Serves as both a textbook and an introduction to graph theory research, suitable for both mathematicians and computer scientists Features many new exercises of varying levels of difficulty to help the reader master the techniques An accompanying website/blog at blogs.springer.com/bondyandmurty provides a forum for further discussion and a wealth of supplementary material Includes supplementary material: sn.pub/extras

Autorentext

Zusammenfassung
Commonly used proof techniques are described and illustrated, and a wealth of exercises - of varying levels of difficulty - are provided tohelp the reader master the techniques and reinforce their grasp of the material. A second objective is to serve as an introduction to research in graph theory.

Inhalt
Graphs.- Subgraphs.- Connected Graphs.- Trees.- Nonseparable Graphs.- Tree-Search Algorithms.- Flows in Networks.- Complexity of Algorithms.- Connectivity.- Planar Graphs.- The Four-Colour Problem.- Stable Sets and Cliques.- The Probabilistic Method.- Vertex Colourings.- Colourings of Maps.- Matchings.- Edge Colourings.- Hamilton Cycles.- Coverings and Packings in Directed Graphs.- Electrical Networks.- Integer Flows and Coverings.