Graph Theory · MA015 Graph Algorithms

Graph Atlas

Two university courses on graphs, written out in full: every definition, every theorem with a complete proof, and a picture you can play with wherever a picture helps.

Start with Graph Theory Graph Algorithms

The Petersen graph. Drag the vertices; it stays the same graph.

Graph Theory

5 lessons: graphs and degrees, walks and bipartite graphs, trees, chordal and Hamiltonian graphs, connectivity and Menger's theorem.

Graph Algorithms

3 lessons: minimum spanning trees (from Kruskal to the randomized linear-time algorithm) and maximum flows, with step-by-step players.

Reference

All 59 definitions and 92 results in one place, each linked back to its lesson.

Practice and exam prep

50 interactive exercises and quick checks, random drills, and flashcards for every definition and theorem.

Playground

Draw any graph, generate classic families, run the algorithms from the courses on it, and export it as TikZ for your homework.

An unofficial student resource based on the lectures Graph Theory (P. Hliněný) and MA015 Graph Algorithms (Jan Obdržálek) at the Faculty of Informatics, Masaryk University. Material marked “beyond the lectures” was added for completeness.