DIMACS/DIMATIA/Renyi Working Group on Graph Colorings and their Generalizations II

August 2 - 4, 2004
Prague, Czech Republic

Fred Roberts, DIMACS, froberts@dimacs.rutgers.edu
Jaroslav Nesetril, Charles University, nesetril at kam.mff.cuni.cz
The Rényi Institute Home Page

DIMACS/DIMATIA/Rényi Working Group on Graph Colorings and their Generalizations Main Page

DIMACS/DIMATIA/Renyi Tripartite Partnership

The central topic of the workshop is generalization of graph colorings, motivated by practical applications like channel assignment in communications, traffic phasing, fleet maintenance, task assignment, and others. On the workshop will be surveyed and investigated such generalizations of graph coloring as T-colorings, list colorings, L(2,1)-colorings, and set colorings, with an emphasis on the graph coloring concepts that arise from channel assignment problems, and design of graph coloring algorithms for new models and applications.

Please see http://kam.mff.cuni.cz/conferences/DDR04/ for further information.

Next: Call for Participation
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on June 30, 2004.