1736
Euler solved the Königsberg bridges problem
It launched graph theory. Today, every map and dependency tree is still composed of vertices and edges.
Graph theory · Udemy course
A structured journey from first definitions to matching, coloring, and algorithms. Delivered as a course you can stream anytime, with exercises, comments and solutions.

Why learn graph theory?
There is a graph hidden in every network, roadmap, and dependency. Learn the vocabulary once: circuits, planarity, transversals, and you’ll recognize the patterns across operations, research and everyday habits.
1736
It launched graph theory. Today, every map and dependency tree is still composed of vertices and edges.
ξ(G)
Graphs can be studied in many different ways. They yield very interesting properties. Many of them are interconnected and have many practical applications.
4
Any political map can be coloured using four colours. There are some exceptions to this rule, which you will learn about in the course.
19958400
A courier delivering goods to twelve customers can plan the order of visited points in so many ways Each additional customer drastically increases this number.
Serious math, packaged for how people actually watch courses today
Watch on web or in the mobile app. Pause, replay, and learn at the pace that fits your schedule.
Pictures before formalism. Then we tighten definitions and proofs, so the ideas can be transferred.
Quizzes and problem sets after the major topics, so you can apply what you just learned in the lectures.
Curriculum
Engaging lectures and short quizzes. Jump to what you need, or follow the path from start to finish. Solve problem sets to consolidate your knowledge. Review comments and solutions.
Vertices, edges, isomorphism, and matrix representation. The language used across all of graph theory.
Properties of complete, linear, bipartite, and wheel graphs. The concepts of subgraphs, line graphs, vertex and edge connectivity.
Euler's theorem, Fleury's algorithm. Sufficient and necessary conditions. Dirac's and Ore's theorems.
Shortest path problem, salesman problem and knight's tour problem will be presented. We will learn the properties of trees and become skilled at proving theorems.
We'll learn tools that can help us diagnose whether a given graph is planar or not. We'll colour vertices, edges, faces in the graph and then explore the consequences.
We'll learn tools that can help us diagnose whether a given graph is planar or not. We'll colour vertices, edges, faces in the graph and then explore the consequences.
Checkout, refunds, and coupons are handled entirely on Udemy, including 30-day money-back guarantee on eligible purchases.