"Computation of lucky number of planar graphs is NP-hard."

Arash Ahadi et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2011.11.002

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/AhadiDKM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/AhadiDKM12
Arash Ahadi, Ali Dehghan, Mohammad Reza Kazemi, E. Mollaahmadi:
Computation of lucky number of planar graphs is NP-hard. Inf. Process. Lett. 112(4): 109-112 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.