Muñoz, Susana; Teresa Ortuño, M.; Ramírez, Javier; … - In: Omega 33 (2005) 3, pp. 211-221
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...