1. All-to-all wavelength routing in all-optical compound networks;Amar;Discrete Math.,2001
2. B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, U. Vaccaro, Graph problems arising from wavelength-routing in all-optical networks, in: Proceedings of the 2nd IPPS Workshop on Optics and Computer Science, Geneva, 1997.
3. A note on the dimensionality of modified Knödel graphs;Bermond;IJFCS: Int. J. Foundations Comput. Sci.,1997
4. The forwarding index of communication networks;Chung;IEEE Trans. Inform. Theory,1987
5. J. Cohen, P. Fraigniaud, C. Gavoille, Recognizing bipartite incident-graphs of circulant digraphs, in: 25th International Workshop on Graph–Theoretic Concepts in Computer Science (WG’99), Vol. 1665 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pp.215–227.