The complexity of consecutive Δ-coloring of bipartite graphs: 4 is easy, 5 is hard

Ars Combinatoria

Volumn 47, Issue , 1997, Pages 287-298

  Giaro, Krzysztof ^a  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038873932     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. A.S. Asratian, R.R. Kamalian, Investigation on interval edge-colorings of graphs, J. of Combinatorial Theory, Ser. B 62 (1994), 34-43.
2. S. Even, A. Itai, A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. on Computing 5 (1976), 691-703.
3. K. Giaro, M. Kubale, M. Malafiejski, Consecutive coloring the edges of a general graph, Tech. Rep. No. 28/95, Technical University of Gdańsk, ETI Faculty, Gdańsk (1995).
4. H.M. Hansen, Scheduling with minimum waiting periods (In Danish), Master Thesis, Odense University, Odense, Denmark, 1992.
5. D. Hanson, C.O.M. Loten, A lower bound for interval colouring of biregular bipartite graphs, Bull. of Institute of Combinatorics and Its Applications 18 (1996), 69-74.
6. T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley, New York (1995), 203-205.
7. S. Micali, V.V. Vazirani, An O(m√n) algorithm for finding maximum matching in general graphs, Proc. 21st Ann. IEEE Symp. on Foundations of Computer Science (1980), 17-27.
8. S.V. Sevastjanow, On interval edge colouring of bipartite graphs (in Russian), Meth. Disc. Anal. 50 (1990), 61-72.