1. The complexity of clique graph recognition;Alcón;Theoretical Computer Science,2009
2. J. Barrionuevo, A. Calvo, Sobre grafos circulares ysin diamantes, M.Sc. Thesis, Departamento de Computación, FCEyN, Universidad de Buenos Aires, Buenos Aires, 2004 (in Spanish).
3. Derived graphs of digraphs;Beineke,1968
4. Characterizations of derived graphs;Beineke;Journal of Combinatorial Theory,1970
5. Graphs and Hypergraphs;Berge,1985