This book serves as a primer in algorithmic graph theory. Using the free and open-source mathematics program Sage, theory and algorithms are illustrated.

You can download the entire book or look at the table of contents, which is displayed below, to obtain an overview of the content. If you observe how our names are utilized to shorten the title of the book, it is more generally referred to as the "DaMNeD" book.

This book on graph theory is geared toward computer scientists, while mathematicians with an interest in computational complexity can also benefit from it.

The emphasis is on algorithms and their complexity: which graph problems have known efficient solutions and which are intractable. It does introduce most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colorability, flows in networks, matchings, and traversals) as well as many of the major classical theorems.