Author:
Golovach Petr A.,Heggernes Pinar,Kratsch Dieter,Rafiey Arash
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Abello, J., Pardalos, P., Resende, M.: On maximum clique problems in very large graphs. In: External memory algorithms and visualization. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 50, pp. 119–130. AMS (1999)
2. Agnarsson, G., Greenlaw, R., Halldórsson, M.M.: On powers of chordal graphs and their colorings. In: Proceedings of SICCGTC 2000, vol. 144, pp. 41–65 (2000)
3. Alba, R.: A graph-theoretic definition of a sociometric clique. Journal of Mathematical Sociology 3, 113–126 (1973)
4. Lecture Notes in Computer Science;Y. Asahiro,2010
5. Balakrishnan, R., Paulraja, P.: Correction to: “Graphs whose squares are chordal”. Indian J. Pure Appl. Math. 12(8), 1062 (1981)