1. B. Beauquier, J.C. Bermond, L. Gargano, S. Hell, P. Perennes, U. Vaccaro, Graph problems arising from wavelength-routing in all-optical networks, in: Proc. of 2nd Workshop on Optics and Computer Science, part of IPPS, 1997
2. Graphs and Hypergraphs;Berge,1973
3. A characterization of rigid circuit graphs;Buneman;Discrete Math.,1974
4. T. Erlebach, K. Jansen, Scheduling of virtual connections in fast networks, in: Proc. of the 4th Parallel Systems and Algorithms Workshop, PASA’96, 1996, pp. 13–32
5. A recognition algorithm for the intersection graphs of paths in trees;Gavril;Discrete Math.,1978