NAME: Darious M.

Padaong 3BPED-B

For each graph below:

1. Write the degree of each vertex.

2. Determine if the graph contains an Euler trail, an Euler circuit, or neither.

3. If an Euler path or Euler circuit exist, give it down (e..g.abcde)

4 4
2

4 2
4

2 2
4

2. The graph contains a Euler circuit . 2. The graph contains a Euler circuit.

3. agefaebdghdchicba 3. adbedcea
 4 4
4 4

4
3
4

4 4
3

2. The graph contains a Euler circuit.

2. The graph contains a Euler trail.
3. abcdebecada 3. cebabdacde