Graph Theory: A Problem Oriented Approach combines the best features of a textbook and a problem workbook. It is ideal for mathematics, computer science, and engineering students seeking a straightforward presentation of the subject's essential ideas. Topics include spanning tree algorithms, Euler paths, Hamilton paths and cycles, independence and covering, connections and obstructions, vertex and edge colorings, Hall's Theorem, the Konig-Egervary Theorem, matrices, and Latin squares.
Nearly 400 strategically placed problems, with connecting text, help students master these and other topics. About 280 homework problems supplement the material. The problem-oriented format encourages reader involvement. This approach is especially valuable for understanding proofs. Arguments are arranged in digestible chunks and come with concrete examples.