1. Dirac, G.A.: On rigid circuit graphs, Abh. Math. Sem. Univ. Hamb.25, 71–76 (1961)
2. Györi, E., Tuza, Zs.: Decompositions of graphs into complete subgraphs of given order. Stud. Sci. Math. Hung.22, 315–320 (1987)
3. Kirkman, T.P.: On a problem in combinatorics. Cambridge and Dublin Math. J.2, 191–204 (1847)
4. Lehel, J., Tuza, Zs.: Triangle-free partial graphs and edge covering theorems. Discrete Math.39, 59–65 (1982)
5. Mantel, W.: Problem 28, solution by Gouwentak, H., Mantel, W., Teixera de Mattes, J., Schuh F., and Wythoff, W.A., Wiskundige Opgaven10, 60–61 (1907)