You are given a graph in the form of a text file, that you are supposed to color.\u00a0 The proper vertex coloring is such that each vertex is assigned a color and no two adjacent vertices are assigned the same color.<\/p>\n\n\n\n
# Everything that starts with # is a comment<\/p>\n\n\n\n
# First non comment line is of form Colors = n<\/p>\n\n\n\n
Colors = 3<\/p>\n\n\n\n
# Here comes the graph<\/p>\n\n\n\n
1,3<\/p>\n\n\n\n
2,18<\/p>\n\n\n\n
3,19<\/p>\n\n\n\n
2,19<\/p>\n\n\n\n
# The \u201cgraph\u201d presented above has 5 vertices: \u201c1\u201d, \u201c2\u201d, \u201c3\u201d, \u201c18\u201d and \u201c19\u201d, and 4 edges.<\/p>\n\n\n\n
# Only the edges are provided in terms of first vertex and second vertex<\/p>\n\n\n\n
# Edges are undirected: 1 is adjacent to 3, and 3 is adjacent to 1.<\/p>\n\n\n\n
# In some graphs, the edge may be included twice (1,3) as well as (3,1) \u2013 just ignore the second one.<\/p>\n\n\n\n
Some example problems can be found at:<\/p>\n\n\n\n