# Wiley Series in Discrete Mathematics and Optimization

Discrete mathematics, the study of finite structures, is one of the fastest growing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the ever-increasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms. The Wiley Series in Discrete Mathematics and Optimization will be a substantial part of the record of the extraordinary development in this field.