Graphs, Algorithms, and Optimization

William Kocay, Donald L. Kreher

Chapman and Hall/CRC
Published September 26, 2016
Textbook - 546 Pages - 302 B/W Illustrations
ISBN 9781482251166 - CAT# K23807
Series: Discrete Mathematics and Its Applications

For Instructors Request Inspection Copy


Add to Wish List
FREE Standard Shipping!


New to this edition

  • The action of permutation groups on graphs

  • Graph automorphism groups

  • Subgraph counting

  • How to draw a graph nicely on the plane, torus, and projective plane, using coordinate averaging

  • Use of the double cover

  • Embedding graphs on the Klein bottle and double torus

  • The double torus as a factorization of the hyperbolic plane

  • Graph homomorphisms

  • Edmonds' matching algorithm

  • Provides a thorough treatment of graph theory along with data structures to show how algorithms can be programmed

  • Includes three chapters on linear optimization which show how linear programming is related to graph theory

  • Emphasizes the use of programming to solve graph theory problems

  • Presents the algorithms from a generic point of view, usable with any programming language



The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.




We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.

Request an
e-inspection copy

Share this Title