A linear time algorithm for edge coloring of binomial trees

Discrete Mathematics

Volumn 150, Issue 1-3, 1996, Pages 247-256

  Kubale, M ^a   Piwakowski, K ^a  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041822629     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00191-X     Document Type: Article

References (7)

1. E.G. Coffman, Jr., M.R. Garey, D.S. Johnson and A.S. LaPaugh, Scheduling file transfers in a distributed network, SIAM J. Comput. 14 (1985) 744-780.
2. R. Cole and J. Hopcroft, On edge coloring bipartite graphs, SIAM J. Comput. 11 (1982) 540-546.
3. I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981) 718-720.
4. H. Krawczyk and M. Kubale, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Trans. Comput. C-34 (1985) 869-872.
5. M. Kubale, Interval edge-coloring of caterpillars with hairs of arbitrary length, Zast. Mat. 19 (1987) 505-517.
6. S. Mitchell and S. Hedetniemi, Linear algorithms for edge coloring trees and unicyclic graphs, Inform. Process. Lett. 9 (1979) 110-112.
7. K. Piwakowski and M. Trojanowicz, Application of a Boltzmann machine to timetable design, Appl. Math. Comp. Sci. 4 (1994) 475-482.