I. Multiple Choice: Choose the best answer to the following questions. 1. A graph is 2-colorable if and only if it has no circuits that consists of an odd number of vertices. d. four-color a. 2-colorable puzzle b. Suduko puzzles c. 2-colorable graph theorem theorem 2. Is a path that uses every edge in the graph exactly once but it does not start and end at the same vertex. a. Hamiltonian graph b. Euler graph c. graph color d. none of these 3. A graph is called_ a. zero 4. A graph with no loops and no multiples edges is called_? a. Null graph b. Simple graph 5. A set of points called vertices and line segments or curve called edges that connect vertices. a. Graph Theory 6. If two or more edges connect the same vertices. Connected edges b. Complete graph _if it has vertices but no edges and its degree is 0.. b. null c. loop d. simple graph c. Complete graph d. none of these b. Graph c. Line d. Circuit c. Multiple edges d. Connected vertices 7. A connected graph in which every possible edge is drawn between vertices. a. Connected graph 8. Can be thought of as a movement from one vertex to another by traversing edges. a. Path 9. If a path ends at the same vertex at which it started. a. Loop 10. A circuit that uses every edge, but never uses the same edge twice. a. Graph b. Complete graph c. Closed graph d. Circuits b. Circuit c. Edges d. Traversed edges b. Path c. Circuit d. Euler circuit b. Path c. Circuit d. Euler circuit