This document introduces vertex-edge graphs and how to color them using the least number of colors. It defines key terms like edge, vertex, and piece. It explains that in vertex-edge graphs, two pieces sharing a common edge cannot be the same color. The goal is to use the fewest colors possible to color the graph correctly.

1. Introduction to Vertex-Edge Graphs Learn how to color vertex-edge graphs using the least amount of colors

2. What is an edge ? An edge is the side of the shape. How many edges does a rectangle have? 3 2 4

3. Sorry! Try again!

4. You are right! A rectangle has 4 edges!

5. What is a vertex ? A vertex is the point where two sides of a shape meet. How many vertices does the triangle have? 4 3

6. Sorry! Try again!

7. You are right! A triangle has 3 vertices!

8. What is a piece ? Each different colored section is a piece of this graph.

9. In a vertex-edge graph, two pieces that have a shared or common edge cannot be the same color.

10. We want to use the fewest colors we can to color the graph. What does fewest mean? Most / More Least / Less

11. Sorry! Try again!

12. You are right! Fewest means least or less.

13. Which vertex-edge graph is colored correctly using the fewest colors? Remember— Pieces that have a shared or common edge cannot be the same color. 2 3

14. Sorry! Try again!

15. You are right! Remember: When you color vertex-edge graphs, you must use the fewest amount of colors so that no pieces that have a common or shared edge are the same color .