Feasible edge colorings of trees with cardinality constraints

Discrete Mathematics

Volumn 222, Issue 1-3, 2000, Pages 61-72

  De Werra, D ^a   Hertz, A ^a   Kobler, D ^a   Mahadev, N V R ^b  

^a EPFL   (Switzerland)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Cardinality constraints; Cost; Edge coloring; Feasible colors; Open shop; Timetabling

Indexed keywords

EID: 0346386125     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00006-6     Document Type: Article

References (18)

1. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
2. J. Blazewicz, K. Ecker, G. Schmidt, J. Weglarz, Scheduling in Computer and Manufacturing Systems, Springer, Berlin, 1993.
3. M. Dror, G. Finke, S. Gravier, W. Kubiak, On the complexity of a restricted list-coloring problem, Discrete Math. 195 (1999) 103-109.
4. S. Even, A. Itai, A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput. 5 (1976) 691-703.
5. J. Folkman, D.R. Fulkerson, Edge colorings in bipartite graphs, in: R.C. Bose and T.A. Dowling (Eds.), Combinatorial Mathematics and its Applications, University of North Carolina Press, Chapel Hill, 1969, pp. 561-577.
6. H. Gabow, T. Nishizeki, O. Kariv, D. Leven, O. Terada, Algorithms for edge-coloring graphs, unpublished manuscript, University of Colorado, Boulder, 1983.
7. S. Gravier, D. Kobler, W. Kubiak, Complexity of list coloring problems with a fixed number of colors, ORWP-EPFL 97/13, September 1997.
8. P. Hansen, A. Hertz, J. Kuplinsky, Bounded vertex colorings of graphs, Discrete Math. 111 (1993) 305-312.
9. P. Hansen, A. Hertz, N. Quinodoz, Splitting trees, Discrete Math. 165/166 (1997) 403-419.
10. K. Jansen, Complexity results for the optimum cost chromatic partition problem, Report 96-41, Universität Trier, 1996.
11. K. Jansen, Approximation results for the optimum cost chromatic partition problem, Report 97-01, Universität Trier, 1997.
12. S. Nicoloso, M. Sarrafzadeh, X. Song, On the sum coloring problem on interval graphs, R. 390, IASI-CNR, Roma, 1994.
13. D. de Werra, Some remarks on good colorations, J. Combin. Theory 21 (1976) 57-64.
14. D. de Werra, Restricted coloring models for timetabling, Discrete Math. 165/166 (1997) 161-170.
15. D. de Werra, On a Multiconstrained Model for Chromatic Scheduling, Discrete Appl. Math. 94 (1999) 171-180.
16. D. de Werra, F. Glover, E.A. Silver, A chromatic scheduling model with costs, IIE Trans. 27 (1995) 181-189.
17. D. de Werra, A. Hoffman, N.V.R. Mahadev, U. Peled, Restrictions and Preassignments in Preemptive Open Shop Scheduling, Discrete Appl. Math. 68 (1996) 169-188.
18. D. de Werra, N.V.R. Mahadev, Preassignment requirements in chromatic scheduling, Discrete Appl. Math. 76 (1997) 95-101.