|
|||||
|
|
Computation of lucky number of planar graphs is NP-hard |
|
| Authors: | A Ahadi A Dehghan M Kazemi E Mollaahmadi |
| Affiliation: | Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran |
| Abstract: | |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |
