R. Carraghan and P. M. Pardalos, “An exact algorithm for the maximum clique problem,” Operation Research Letters 9 (1990), 375-382. doi:10.1016/0167-6377(90)90057-C

has been cited by the following article:

• TITLE: Factoring Elementary p-Groups for p ≤ 7

  AUTHORS: Sándor Szabó

  KEYWORDS: Factorization of Finite Abelian Groups, Full-Rank Subset, Full-Rank Factorization, Periodic Subset, Periodic Factorization, Rédei’s Conjecture, Corrádi’s Conjecture

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.1 No.1, April 8, 2011

  ABSTRACT: It is an open problem if an elementary p-group of rank k ≥ 3 does admit full-rank normalized factorization into two of its subsets such that one of the factors has p elements. The paper provides an answer in the p ≤ 7 special case.