Q1:

Explain the terms: bipartite graph, planar graph, Euler graph and regular graph.

Q2:

What is the Euler formula?

Q3:

Prove: A connected multigraph has an Euler circuit if and only if each of its vertices has even degree

Q4:

Prove: A connected multigraph has an Euler path but not Euler circuit if and only if it has exactly two vertices of odd degree.

Q5:

Explain about the planarity testing algorithm.

Q6:

Define Hamilton graph along with Hamilton path and Hamilton circuit.