Showing 1 - 1 of 1
Given a graph G=(V,E), a coloring function C assigns an integer value C(i) to each node i[set membership, variant]V in such a way that the extremes of any edge {i,j}[set membership, variant]E cannot share the same color, i.e., C(i)[not equal to]C(j). Two different approaches to the graph...
Persistent link: https://www.econbiz.de/10005336220