Name _________________________________ Date _______ Pd. ______ 1.2 Finding Euler Circuit Assignment Are these four graphs vertex-edge graphs or not? Explain why as well. If the graph is a vertexedge graph determine how many vertices and edges the graph has and the valences for each vertex. 1. 2. 3. 4. For each of the graphs, determine if they are an Euler Circuit, Euler Path, or Vertex-Edge Graph. If the graph has an Euler Circuit or Euler Path, label the graphs with arrows to show the path and list the circuit or path below. 5. __________________________________ 6. _________________________________ Circuit/Path: _________________________ Circuit/Path: _________________________ 7. __________________________________ 8. __________________________________ Circuit/Path: _________________________ Circuit/Path: _________________________ 9. __________________________________ 10. ________________________________ Circuit/Path: _________________________ Circuit/Path: _________________________ 11. __________________________________ Circuit/Path: ___________________________________________________________________ 12. __________________________________ Circuit/Path: ___________________________________________________________________ 13. __________________________________ Circuit/Path: ___________________________________________________________________