Discover the mathematics of connections and networks through 35 interactive demonstrations.
See also: Combinatorics for counting problems and extremal results on graphs, Linear Algebra for adjacency-matrix eigenvalues and spectral graph theory, and Algorithms for shortest paths, flows, and traversal as core building blocks.
What is a graph? Vertices, edges, and basic notation
Degree, connectivity, and special graph types
Tree properties, spanning trees, and traversal algorithms
Eulerian paths, Hamiltonian cycles, and shortest paths
Chromatic number, the four color theorem, and applications
Euler's formula, planarity testing, and Kuratowski's theorem
Max flow, min cut, and the Ford-Fulkerson algorithm
Eigenvalues, the Laplacian, and spectral clustering
Erdos-Renyi, small-world, and scale-free networks