On the complexity of a restricted list-coloring problem

Discrete Mathematics

Volumn 195, Issue 1-3, 1999, Pages 103-109

  Dror, Moshe ^a   Finke, Gerd ^b   Gravier, Sylvain ^c   Kubiak, Wieslaw ^b,d  

^a UNIVERSITY OF ARIZONA   (United States)

^b UNIV GRENOBLE ALPES   (France)

^c EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^d MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347366240     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00169-1     Document Type: Article

References (8)

1. J. Blazewicz, J. Barcello, W. Kubiak, H. Röck, Scheduling tasks on two processors with deadlines and additional resources, Europ. J. Oper. Res. 26 (1986) 364-370.
2. P. Erdös, A.L. Rubin, H. Taylor, Choosability in graphs, Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Arcata, California, Congr. Numer. XXVI (1979) 125-157.
3. S. Gravier, Coloration et produits de graphes, Thesis, Université Joseph Fourier, Grenoble, France, June 1996 (in French).
4. S. Gravier, D. Kobler, W. Kubiak, Complexity of list coloring problems with a fixed total number of colors (1997), submitted.
5. K. Jensen, private communication, June 1997.
6. V.G. Vizing, Vertex colorings with given colors, Methods Discret. Analiz 29 (1976) 3-10 (in Russian).
7. D. de Werra, Restricted coloring models for timetabling, Discrete Math. 165/166 (1997) 161-170.
8. K. Xu, A special case of edge-chromatic scheduling problem, EPFL, Report ORWP 96/03, Lausanne.