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

Arash Ahadi et al. (2012)

Details and statistics

DOI: 10.1016/J.IPL.2011.11.002

access: closed

type: Journal Article

metadata version: 2020-10-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics