I.

Euler & Hamilton Paths & Circuits

Answer the following.

a. How many vertices are there in the graph?

6

b. What is the degree of vertex D?

c. Find an Euler Path or Circuit if there is any.

F-C-B(Straight)-D-C-A-B(Curve)-D-F-E-A

d. Find a Hamiltonian Path or Circuit if there is any.

A-C-B-D-F-E-A

a. How many vertices are there in the graph?

6

b. What is the degree of vertex E?

c. Find an Euler Path or Circuit if there is any.

E-D-C-E-F(Curve)-D-F(Straight)-A(Curve)-E-
A(straight)-B(curve)-C-B(straight)-E

d. Find a Hamiltonian Path or Circuit if there is any.

A-B-E-C-D-F-A

a. How many vertices are there in the graph?

6

b. What is the degree of vertex A?

c. Find an Euler Path or Circuit if there is any.

A-B-C-D-F-A-E-D-A

d. Find a Hamiltonian Path or Circuit if there is any.

F-A-E-D-C-B
 II. Graph Coloring

1. Find the Chromatic number of each of the ffg. graph.

A.2
B.3
C.4
D. 5
E. 3

2. The fictional map below shows the boundaries of countries on a rectangular continent.
a.) Represent the map as a graph.

A G
 b.) Find the coloring of the graph using the fewest possible number of colors.

A B C D E F G H

1 2 3 2 3 2 3 1

c.) Color the map according to graph coloring theorem.

 III. Trees
1.

The graph B is the only Tree among the 6 graphs.

2.

a. Which vertices are the children of vertex j.

Vertices N, O, and P are the children of vertex J.
b. Which vertices are ancestors of vertex s.
Vertices M, I, D, B, and A are the ancestors or vertex S.
c. Which vertices are the siblings of verter q.
Vertices R, S, and T are the siblings or vertex q.
d. Find the number of leaves in the tree.
11 leaves
e. Which vertices are at level 3.
Vertices H,K, and L are the vertices at level 3.
f. Find the height of the tree.
The height of the tree is 5.