M. Tismenetsky
International Journal of Computer Mathematics
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.
M. Tismenetsky
International Journal of Computer Mathematics
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
John S. Lew
Mathematical Biosciences