Computation of lucky number of planar graphs is NP-hard

Arash Ahadi, Ali Dehghan, M. Kazemi, E. Mollaahmadi. Computation of lucky number of planar graphs is NP-hard. Inf. Process. Lett., 112(4):109-112, 2012. [doi]

Abstract

Abstract is missing.