The primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated. The book also serves as an introduction to research in graph theory.
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.
Number Of Pages:
Softcover reprint of hardcover 1st ed. 2008