1. Lecture Notes in Computer Science;M.-S. Chang,2006
2. Dahlhaus, E., Duchet, P.: On strongly chordal graphs. Ars Combin. 24 B, 23–30 (1987)
3. Farber, M.: Characterizations of strongly chordal graphs. Discrete Math. 43, 173–189 (1983)
4. Farzad, B., Lau, L.C., Le, V.B., Nguyen, N.T.: Computing graph roots without short cycles. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), pp. 397–408 (2009)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability–A Guide to the Theory of NP-Completeness. Freeman, New York (1979); Twenty-third printing (2002)