k L-list τ colouring of graphs

European Journal of Operational Research

Volumn 106, Issue 1, 1998, Pages 160-164

  De Luca Cardillo, Dorotea ^a   Mione, Nicola ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Graph colouring; Heuristics; Scheduling; Trains platforming

Indexed keywords

EID: 0039392440     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00299-9     Document Type: Article

References (12)

1. V. Lofti, K. Sarin, A graph coloring algorithm for large scale scheduling problems, Computers and Operation Research 13 (1) (1986) 27-32.
2. P. Prosser, Hybrid algorithms for the constraint satisfaction problem, Computational Intelligence 3 (9) (1993) 268-299.
3. E. Tsang, Foundation of Constraint Satisfaction, Harcourt, Brace and Jovanovich, New York, 1993.
4. P. Marinò, Tecniche di riduzione per una particolare classe di problemi di soddisfacimento dei vincoli, Tesi di Laurea in Matematica, Anno Accademico 1994/1995, Firenze, Italy.
5. A. Casavola, D. De Luca Cardillo, P. Petrelli e E, Vespi, Modelli per la determinazione del grafo per stazioni di grandi dimensioni, Giornate di Lavoro AIRO 93, Capri, 1993.
6. B. Bollobas, A.J. Harris, List-colorings of graphs, Graphs and Combinatorics 1 (1985) 115-127.
7. P. Erdös, A.L. Rubin, H. Taylor, Choosability in graphs, Congressus Numerantium 26 (1979) 125-157.
8. T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley, New York, 1995.
9. B.A. Tesman, List T-colorings of graphs, Discrete Applied Mathematics 45 (1993) 277-289.
10. V.G. Vizing, Vertex colorings with given colors (in Russian), Metody Diskretnogo Analiza 14 (1976) 3-10.
11. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1978.
12. N. Christofides, An algorithm for the chromatic number of a graph, Computational Journal 14 (1971) 38-39.