TY  - JOUR
AU  - Ortuño, M. T.
AU  - Muñoz, Susana
AU  - Ramírez, Javier
AU  - Yáñez, Javier
PY  - 2005
DO  - http:// 10.1016/j.omega.2004.04.006
SN  - 0305-0483
UR  - https://hdl.handle.net/20.500.14352/50238
T2  - OMEGA - The International Journal of Management Science
AB  - Given a graph G = (V, E), a coloring function C assigns an integer value C(i) to each node i epsilon V in such a way that the extremes of any edge {i,j} epsilon E cannot share the same color, i.e., C(i) epsilon C(j). Two different approaches to the...
LA  - eng
M2  - 211
PB  - Pergamon Elsevier Science
KW  - Fuzzy sets
KW  - Graph theory
KW  - Optimization
KW  - Timetabling
KW  - Chromatic number
KW  - Algorithm
TI  - Coloring fuzzy graphs
TY  - journal article
VL  - 33
ER  -