discrete mathematics 7th johnsonbaugh
ons: vertices, edges, degree, paths, cycles Special graphs: complete, bipartite, trees, planar graphs Graph traversals: Depth-first search, breadth-first search Graph coloring: Chromatic number, applications Network flows: Basic concepts and algorithms Strengths: The intuitive approach helps stud