References
- Blackburn, S. R., Britnell, J. R., Wildon, M. (2012). The probability that a pair of elements of a finite group are conjugate. J. London Math. Soc. 86(3):755–778. DOI: 10.1112/jlms/jds022.
- Brauer, R., Fowler, K. A. (1955). On groups of even order. Ann. Math. 62(2):567–583.
- Cayley, A. (1878). Desiderata and suggestions: No. 2. the theory of groups: Graphical representation. Am. J. Math. 1(2):174–176. DOI: 10.2307/2369306.
- Erdős, P., Faudree, R., Ordman, E.T. (1988). Clique partitions and clique coverings. Discrete Math. 72:93–101. DOI: 10.1016/0012-365X(88)90197-5.
- Gao, Y., Yan, J., Zhang, B. (2014). Graph partition into small cliques. Discrete Appl. Math. 162:32–327. DOI: 10.1016/j.dam.2013.09.003.
- Mahmoudifar, A., Moghaddamfar, A. R., Salehzadeh, F. (2019). Group partitions via commutativity. Int. Electron. J. Algebra 25:224–231.
- Neumann, B. H. (1976). A problem of Paul Erdos on groups. J. Aust. Math. Soc. 21(4):467–472. DOI: 10.1017/S1446788700019303.
- Niemenmaa, M. (2011). A check digit system for hexadecimal numbers. AAECC. 22(2):109–112. DOI: 10.1007/s00200-011-0139-3.
- Pardalos, P.M., Rebennack, S. (2010). Computational challenges with cliques, quasi-cliques and clique partitions in graphs. In: Lecture Notes in Computer Science, Vol. 6049. Berlin, Heidelberg: Springer.
- Wielandt, H. (1964). Finite Permutation Groups. New York, San Francisco, London: Academic Press.