This volume covers the principal branches of graph theory in more than a thousand exercises of varying complexity. Each section starts with the main definitions and a brief theoretical discussion, which will serve as a reminder when solving the problems. Answers and hints are supplied separately. Topics include trees, independence and coverings, matchings, tours, planarity, colourings, degree sequences, connectivity, digraphs and hypergraphs. <br/> <em>Audience:</em> This work will be valuable to researchers, lecturers and graduate students in graph theory, combinatorics, VLSI design, circuits and systems, and mathematical programming and optimization.