Question: 1. Let G be the graph below, with 11 vertices and 20 edges. Clearly explain why (G)=4. 2. Create a simple greedy algorithm for coloring

1. Let G be the graph below, with 11 vertices and 20 edges. Clearly explain why (G)=4.

1. Let G be the graph below, with 11 vertices and 20

2. Create a simple greedy algorithm for coloring the vertices of any graph G, ideally using as few colors as possible. Explain how your algorithm works, i.e., the order in which your algorithm chooses the vertices of a given graph, and how a color is assigned to each vertex. Need to provide algorithm, return statement.

3. Apply your algorithm from 2 to the graph in 1. Show step by step. How many colors did your algorithm use?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!