Counting: The Art of Enumerative Combinatorics provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to...For example, ¿How many ways are there to order a collection of 12 ice cream cones if 8 flavors are available?¿ At the end of the book the reader should be able to answer such nontrivial counting questions as, ¿How many ways are there to color the faces of a cube if ¿k¿ colors are available with each face having exactly one color?¿ or ¿How many ways are there to stack ¿n¿ poker chips, each of which can be red, white, blue, or green, such that each red chip is adjacent to at least 1 green chip?¿ Since there are no prerequisites, this book can be used for college courses in combinatorics at the sophomore level for either computer science or mathematics students. The first five chapters have served as the basis for a graduate course for in-service teachers. Chapter 8 introduces graph theory.