Axiom AcademyAxiom Academy
HomeCoursesFormula SheetsAbout
Axiom Academy
Axiom Academy

Making math accessible and enjoyable through interactive lessons, engaging explanations, and a passion for teaching.

What's New

Learn

  • All Courses
  • Formula Sheets
  • Achievements

Test Prep

  • SAT Math
  • ACT Math
  • GRE Quant
  • Competition Math

Company

  • About
  • Contact

Legal

  • Privacy Policy
  • Terms of Service
  • Accessibility

© 2026 Axiom Academy. All rights reserved.

Built with love for math.

  1. Home
  2. Courses
  3. Graph Theory
G(V,E)

Graph Theory

Vertices, edges, paths, and network algorithms

198Modules
10Units

Being rebuilt

This course is still in our original format. All the content is here and free to use, but it has not yet been through the rebuild that gives our newer courses their interactive animations and cleaner visuals — so you may hit some rough edges. Spot an error? Send us a note and we will fix it.

Recommended preparation

Discrete Mathematics is the natural lead-in — graph theory builds on its logic and proof techniques.

Discrete Mathematics
1
What is Graph Theory?INTRO
2
Graphs Are EverywhereINTRO
3
Vertices and EdgesLESSON
4
Counting Edges ExamplesEXAMPLE
5
Graph NotationLESSON
6
Graph Builder ToolACTIVITY
7
Graph Basics PracticePRACTICE
8
The Seven Bridges of KönigsbergINTRO
9
Degree of a VertexLESSON
10
Degree Counting PracticePRACTICE
11
The Handshaking LemmaLESSON
12
Special GraphsLESSON
13
Complete GraphsLESSON
14
Social Networks as GraphsREAL WORLD
15
Bipartite GraphsLESSON
16
SubgraphsLESSON
17
Graph IsomorphismLESSON
18
Isomorphism Testing ExamplesEXAMPLE
19
Isomorphism CheckerACTIVITY
20
Introduction to Graphs SummarySUMMARY
21
Graph Basics ReferenceREFERENCE
22
Introduction to Graphs QuizQUIZ
1
Walking Through GraphsINTRO
2
Walks, Trails, and PathsLESSON
3
Finding Paths ExamplesEXAMPLE
4
Paths PracticePRACTICE
5
CyclesLESSON
6
Connected vs DisconnectedINTRO
7
Connected GraphsLESSON
8
Connected ComponentsLESSON
9
Cut Vertices and BridgesLESSON
10
Path Finding ToolACTIVITY
11
Distance and DiameterLESSON
12
Shortest PathsLESSON
13
Shortest Paths PracticePRACTICE
14
Dijkstra's AlgorithmLESSON
15
Dijkstra's Algorithm TraceEXAMPLE
16
Dijkstra SimulatorACTIVITY
17
Bellman-Ford AlgorithmLESSON
18
Internet RoutingREAL WORLD
19
GPS NavigationREAL WORLD
20
Paths and Connectivity SummarySUMMARY
21
Paths ReferenceREFERENCE
22
Paths and Connectivity QuizQUIZ
1
What are Trees?INTRO
2
Tree Definition and PropertiesLESSON
3
Tree BuilderACTIVITY
4
Characterizations of TreesLESSON
5
Trees PracticePRACTICE
6
Cayley's FormulaLESSON
7
Counting Trees ExamplesEXAMPLE
8
Trees in Nature and ComputingINTRO
9
Rooted TreesLESSON
10
Binary TreesLESSON
11
Phylogenetic TreesREAL WORLD
12
Spanning TreesLESSON
13
Minimum Spanning TreesLESSON
14
Network DesignREAL WORLD
15
Prim's AlgorithmLESSON
16
Kruskal's AlgorithmLESSON
17
MST Construction ExamplesEXAMPLE
18
MST VisualizerACTIVITY
19
MST PracticePRACTICE
20
Trees SummarySUMMARY
21
Trees ReferenceREFERENCE
22
Trees QuizQUIZ
1
The Eulerian ProblemINTRO
2
Eulerian TrailsLESSON
3
Eulerian Graph ExamplesEXAMPLE
4
Eulerian CircuitsLESSON
5
Euler's TheoremLESSON
6
Eulerian PracticePRACTICE
7
Hierholzer's AlgorithmLESSON
8
Euler Path FinderACTIVITY
9
The Hamiltonian ProblemINTRO
10
Hamiltonian PathsLESSON
11
Hamiltonian Graph ExamplesEXAMPLE
12
Hamiltonian CyclesLESSON
13
Necessary ConditionsLESSON
14
Hamiltonian PracticePRACTICE
15
Ore and Dirac TheoremsLESSON
16
Hamilton Path ExplorerACTIVITY
17
The Traveling SalesmanINTRO
18
Traveling Salesman ProblemLESSON
19
Route Planning ApplicationsREAL WORLD
20
Eulerian and Hamiltonian SummarySUMMARY
21
Eulerian/Hamiltonian ReferenceREFERENCE
22
Eulerian and Hamiltonian QuizQUIZ
1
The Coloring ProblemINTRO
2
Vertex ColoringLESSON
3
Graph Coloring ToolACTIVITY
4
Vertex Coloring PracticePRACTICE
5
Chromatic NumberLESSON
6
Finding Chromatic NumbersEXAMPLE
7
Chromatic Number CalculatorACTIVITY
8
Greedy Coloring AlgorithmLESSON
9
Brooks' TheoremLESSON
10
Register AllocationREAL WORLD
11
Chromatic PolynomialLESSON
12
Chromatic Polynomial ExamplesEXAMPLE
13
Chromatic Polynomial PracticePRACTICE
14
Edge ColoringLESSON
15
Vizing's TheoremLESSON
16
Scheduling ProblemsREAL WORLD
17
Map Coloring HistoryINTRO
18
The Four Color TheoremLESSON
19
Coloring Planar GraphsLESSON
20
Graph Coloring SummarySUMMARY
21
Graph Coloring ReferenceREFERENCE
22
Graph Coloring QuizQUIZ
1
What are Planar Graphs?INTRO
2
Planar Graph DefinitionLESSON
3
Planar EmbeddingsINTRO
4
Planar Embedding ToolACTIVITY
5
Euler's FormulaLESSON
6
Euler Formula ExamplesEXAMPLE
7
Euler Formula PracticePRACTICE
8
Consequences of Euler's FormulaLESSON
9
K₅ and K₃,₃ are Non-PlanarLESSON
10
Platonic SolidsLESSON
11
Circuit Board DesignREAL WORLD
12
Kuratowski's TheoremLESSON
13
Planarity Testing AlgorithmsLESSON
14
Planarity Testing ExamplesEXAMPLE
15
Planarity TesterACTIVITY
16
Planarity PracticePRACTICE
17
Dual GraphsLESSON
18
Planar Graphs SummarySUMMARY
19
Planar Graphs ReferenceREFERENCE
20
Planar Graphs QuizQUIZ
1
The Matching ProblemINTRO
2
Matchings DefinitionLESSON
3
Matching Problem ExamplesEXAMPLE
4
Maximum MatchingsLESSON
5
Matching SolverACTIVITY
6
Bipartite MatchingLESSON
7
Hall's Marriage TheoremLESSON
8
Matchings PracticePRACTICE
9
Hungarian AlgorithmLESSON
10
Job AssignmentREAL WORLD
11
Flow in NetworksINTRO
12
Network Flow BasicsLESSON
13
Network Flow ExamplesEXAMPLE
14
Ford-Fulkerson AlgorithmLESSON
15
Network Flow SimulatorACTIVITY
16
Max-Flow Min-Cut TheoremLESSON
17
Network Flow PracticePRACTICE
18
Applications of Network FlowLESSON
19
Transportation NetworksREAL WORLD
20
Matchings and Flow SummarySUMMARY
21
Matchings and Flow ReferenceREFERENCE
22
Matchings and Flow QuizQUIZ
1
Introduction to Directed GraphsINTRO
2
Digraph BasicsLESSON
3
Digraph BuilderACTIVITY
4
In-Degree and Out-DegreeLESSON
5
Digraphs PracticePRACTICE
6
Directed Paths and CyclesLESSON
7
Strong ConnectivityLESSON
8
Finding Strongly Connected ComponentsLESSON
9
SCC Finding ExamplesEXAMPLE
10
TournamentsLESSON
11
Where Digraphs AppearINTRO
12
Directed Acyclic GraphsLESSON
13
Topological SortingLESSON
14
Topological Sort ExamplesEXAMPLE
15
Topological Sort VisualizerACTIVITY
16
Topological Sort PracticePRACTICE
17
Dependency ManagementREAL WORLD
18
Web Crawling and PageRankREAL WORLD
19
Directed Graphs SummarySUMMARY
20
Directed Graphs ReferenceREFERENCE
21
Directed Graphs QuizQUIZ
1
Algebra Meets Graph TheoryINTRO
2
Matrices from GraphsINTRO
3
The Adjacency MatrixLESSON
4
Matrix Computation ExamplesEXAMPLE
5
Graph Matrix CalculatorACTIVITY
6
Properties of Adjacency MatrixLESSON
7
The Incidence MatrixLESSON
8
Graph Matrices PracticePRACTICE
9
The Laplacian MatrixLESSON
10
Eigenvalues of GraphsLESSON
11
Eigenvalue Analysis ExamplesEXAMPLE
12
Spectral PropertiesLESSON
13
Spectral AnalyzerACTIVITY
14
Spectral Methods PracticePRACTICE
15
Algebraic ConnectivityLESSON
16
Spectral ClusteringLESSON
17
Google PageRankREAL WORLD
18
Algebraic Graph Theory SummarySUMMARY
19
Algebraic Graph Theory ReferenceREFERENCE
20
Algebraic Graph Theory QuizQUIZ
1
Problem Solving GuideSUMMARY
2
Graph Theory Master ReferenceREFERENCE
3
Complete Formula SheetFORMULA SHEET
4
Graph Algorithms GuideFORMULA SHEET
5
Comprehensive Graph Theory TestQUIZ