Graph Coloring Review

Which theorem is represented by the map presented?

• Pythagorean Theorem

• Four Color Theorem

• Appel and Hankin's Theorem

• Primary Color Theorem

The Four Color Theorem's proof was significant because:

• it showed that the world i round

• it costs a lot of money

• it was the first proof that was computer aided

• it took so long to write

Any planar map can be colored with _____ or fewer colors.

• 2

• 3

• 4

• 5

In how many colors can you color this picture, following the rules of the Four Color Theorem?

• 1

• 2

• 3

• 4

You color Alabama ORANGE. Using the Four Color Theorem, what statement is true?

• Mississippi can be ORANGE.

• Georgia can be ORANGE.

• Tennessee cannot be ORANGE.

• Arkansas must be ORANGE.

The smallest number of colors needed to color a graph is called the:

• chromatic number

• graph coloring

• k-coloring

• vertex coloring

What is the max chromatic number of any map?

• 3

• 4

• 5

• 6

Vertex coloring may require _____ 4 colors.

• more than

• less than

• exactly

What color should Vertex 4 be?

• red

• yellow

• purple

• blue

What is this graph's chromatic number?

• 1

• 2

• 3

• 4