Graph Theory: A Problem Oriented Approach

Preface A. Basic Concepts B. Isomorphic graphs C. Bipartite graphs D. Trees and forests E. Spanning tree algorithms F. Euler paths G. Hamilton paths and cycles H. Planar graphs I. Independence and covering J. Connections and obstructions K. Vertex coloring L. Edge coloring M. Matching theory for bipartite graphs N. Applications of matching theory O. Cycle-Free digraphs Answers to selected problems.