1. B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, U. Vaccaro, Graph problems arising from wavelength-routing in all-optical networks, in: The 2nd Workshop on Optics and Computer Science, WOCS’97
2. B. Beauquier, S. Perennes, D. Toth, All-to-all routing and coloring in weighted trees of rings, in: Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA’99, 1999, pp 185–190
3. Graphs;Berge,1985
4. Z. Bian, Q. Gu, X. Zhou, Wavelength assignment on bounded degree trees of rings, in: Proceedings of the Tenth International Conference on Parallel and Distributed Systems, ICPADS’04, 2004, pp 73–80
5. Z. Bian, Q. Gu, X. Zhou, Tight bounds for wavelength assignment on trees of rings, in: Proceedings of the 19th International Parallel and Distributed Processing Symposium, IPDPS’05, CD-ROM, Denver, Colorado, 2005