David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Preemptive open shop scheduling can be viewed as an edge coloring problem in a bipartite multigraph. In some applications, restrictions of colors (in particular preassignments) are made for some edges. We give characterizations of graphs where some special preassignments can be embedded in a minimum coloring (number of colors = maximum degree). The case of restricted colorings of trees is shown to be solvable in polynomial time.
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics