Applied Combinatorics
4th Edition
Published on 7. August 2001
Book
Paperback/Softback
464 pages
978-0-471-43809-0 (ISBN)
Description
The fourth edition of the most widely used book in combinatorial problem explains how to reason and model combinatorically and stresses the systematic analysis of different possibilities, exploration of the logical structure of a problem and ingenuity.
More details
Edition
4., Auflage
Language
English
Place of publication
New York
United States
Publishing group
John Wiley and Sons Ltd
Target group
College/higher education
Professional and scholarly
Edition type
Revised edition
Illustrations
glossary, bibliography, index
Dimensions
Height: 24.6 cm
Width: 16.1 cm
Weight
765 gr
ISBN-13
978-0-471-43809-0 (9780471438090)
Schweitzer Classification
Other editions
Previous edition
Book
05/2003
4th Edition
Wiley
€145.00
Article exhausted; check for reprint
Content
GRAPH THEORY.
Elements of Graph Theory.
Covering Circuits and Graph Coloring.
Trees and Searching.
Network Algorithms.
ENUMERATION.
General Counting Methods for Arrangements and Selections.
Generating Functions.
Recurrence Relations.
Inclusion-- Exclusion.
ADDITIONAL TOPICS.
Polya's Enumeration Formula.
Games with Graphs.
Appendix 1: Set Theory.
Appendix 2: Mathematical Induction.
Appendix 3: A Little Probability.
Appendix 4: The Pigeonhole Principle.
Glossary of Counting and Graph Theory Terms.
Bibliography.
Solutions to Odd-Numbered Problems.
Index.
Elements of Graph Theory.
Covering Circuits and Graph Coloring.
Trees and Searching.
Network Algorithms.
ENUMERATION.
General Counting Methods for Arrangements and Selections.
Generating Functions.
Recurrence Relations.
Inclusion-- Exclusion.
ADDITIONAL TOPICS.
Polya's Enumeration Formula.
Games with Graphs.
Appendix 1: Set Theory.
Appendix 2: Mathematical Induction.
Appendix 3: A Little Probability.
Appendix 4: The Pigeonhole Principle.
Glossary of Counting and Graph Theory Terms.
Bibliography.
Solutions to Odd-Numbered Problems.
Index.