scientific article; zbMATH DE number 1467357

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)

Review text

This book is a textbook, teaching students basic notions from discrete mathematics and graph theory. The book covers notions like sets, functions, integers (e.g., theorems on prime numbers and greatest common divisor). Also, proof techniques like induction and recursion, and the pigeon hole principle are explained. The second half of the book concentrates on graph theory and basic graph algorithms. Topics in this half are paths, circuits (e.g., Hamiltonicity, and applications like the Chinese postman problem and scheduling), trees (e.g., Prim's spanning tree algorithm), depth first search, planar graphs, graph coloring, and maximum flow. Overall, most of the topics that one would expect in courses for first year mathematics (or computer science) students in discrete mathematics and graph theory are treated in the book in a clear manner. The book contains many excercises and examples, and suggestions for a course outline, based on the book.

Recommendations

Cited in

(16)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4486747)