Applied Combinatorics, 6th Edition

Alan Tucker’s newest issue of Applied Combinatorics builds on the previous editions with more in depth analysis of computer systems in order to help develop proficiency in basic discrete math problem solving. As one of the most widely used book in combinatorial problems, this edition explains how to reason and model combinatorically while stressing the systematic analysis of different possibilities, exploration of the logical structure of a problem, and ingenuity.

Table of Contents

Part One: Graph Theory
Chapter 1: Elements Of Graph Theory
Chapter 2: Covering Circuits And Graph Coloring
Chapter 3: Trees And Searching
Chapter 4: Network Algorithms
Part Two: Enumeration
Chapter 5: General Counting Methods For Arrangements And Selections
Chapter 6: Generating Functions
Chapter 7: Recurrence Relations
Chapter 8: Inclusion–Exclusion
Part Three: Additional Topics
Chapter 9: Polya’S Enumeration Formula
Chapter 10: Games With Graphs