Greedy coloring

(10 pts)

In this assignment, you’re going to use a basic greedy algorithm to color a graph. After you do so, you can respond by simply replying with an image of your colored graph. To be clear - your assignment is not just to color the graph any which way but to specifically use the greedy algorithm we discussed in class.

To get you graph, choose your name from the following list:

Here’s my colored graph:

colored_graph885×549 39.9 KB

Here is my colored graph:

untitled1348×847 42.1 KB

Here’s my graph.

Here’s my graph…

@csluder2 I don’t think you’ve generated a proper coloring. I mean, the vertices are colored but a proper coloring has the property that adjacent vertices have different colors, as described in this slideshow

here is my fixed colored graph:

untitled (2)885×575 53.2 KB