Student Statement
I am able to use vertex-edge graphs and graph coloring to resolve conflicts.
Below you can randomize vertex-edge conflict resolution problems. Some have table layouts and some have list layouts. Reveal the answer with the "Check Answers" button. It will not display the graph coloring solution, but it will identify the minimum number of colors needed.
This uses the Welsh-Powell Algorithm (link gives you more information if you want to read). It should come up with the fewest number of colors needed, but it will occasionally make mistakes. There is almost no "easy to implement" algorithm that is perfect all the time. If you see it making a ton of mistakes, please let me know!