1. Routing and path multicoloring;Nomikos;Information Processing Letters,2001
2. Efficient routing in all-optical networks;Raghavan,1994
3. The complexity of coloring circular arcs and chords;Garey;SIAM Journal of Algebraic Discrete Methods,1980
4. Edge intersection graphs of paths in a tree;Golumbic;Journal of Combinatorial Theory B,1985
5. P. Winkler, L. Zhang, Wavelength assignment and generalized interval graph coloring, in: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 830–831.