Graph Theory
Bachelor of Science in Computer Science · University · Core Courses
In this unit you will: apply vertices, edges, degree, and the handshaking lemma; know adjacency matrices, adjacency lists, and properties of trees; run breadth-first search, depth-first search, and topological sorting; apply Dijkstra, Kruskal, Euler, and Hamilton; judge coloring, bipartiteness, and planarity.
There are 50 exercises to practice: interaktive Aufgaben. Every answer gets instant feedback, free and without signing up.
What's included
- Apply vertices · edges · degree · and the handshaking lemma
- Know adjacency matrices · adjacency lists · and properties of trees
- Run breadth-first search · depth-first search · and topological sorting
- Apply Dijkstra · Kruskal · Euler · and Hamilton
- Judge coloring · bipartiteness · and planarity
Example questions
- What is the degree of a vertex in an undirected graph without loops?
- True or false? “In every undirected graph, the number of vertices of odd degree is even.”
- A graph has vertices with degrees 3, 3, 2, 2, and 2. How many edges does it have?