On decomposing complete tripartite graphs into 5-cycles. - Sharareh Alipour; Ebadollah S. Mahmoodian; E. Mollaahmadi (Australas. J Comb., 2012)

Computation of lucky number of planar graphs is NP-hard. - Arash Ahadi; Ali Dehghan 001; Mohammad Reza Kazemi 001; E. Mollaahmadi (Inf. Process. Lett., 2012)