Skills101
← All practice quizzes

Quiz: Graph Theory

5 questionsNo time limitPass: 60%+10 XP on first pass

The graph theory every CS student needs: types of graphs, degree and the handshaking lemma, paths and connectivity, Euler and Hamiltonian circuits, trees (n−1 edges), bipartite graphs, Euler's formula for planar graphs and graph colouring — with Python checks.

Log in to take the quiz

Free account · see your score, answers and explanations, earn XP

  1. Question 1

    A graph has 10 edges. What is the sum of the degrees of all its vertices?

  2. Question 2

    A connected graph has an Euler circuit if and only if:

  3. Question 3

    How many edges does a tree with 25 vertices have?

  4. Question 4

    Which graph is NOT bipartite?

  5. Question 5

    Why is K5 not planar?