|
Textbook
Applied Combinatorics, 6th EditionFebruary 2012, ©2011
![]() |
This book is designed for use by students with a wide range of ability and maturity (sophomores through beginning graduate students). The stronger the students, the harder the exercises that can be assigned. The book can be used for one-quarter, two-quarter, or one-semester course depending on how much material is used.
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 Grapes.
Postlude.
Appendix.
- This new sixth edition has new examples, expanded discussions, and additional exercises throughout the text.
- A closing postlude about crytoanalysis has been added.
- A greater emphasis on underlying reasoning in combinatorial problem-solving has been stressed throughout the text.
- Theory is always first motivated by examples, and proofs are given only when their reasoning is needed to solve applied problems. Elsewhere, results are stated without proof, such as the form of solutions to various recurrence relations, and then applied in problem solving.
- This new sixth edition has new examples, expanded discussions, and additional exercises throughout the text.



