k-L(2,1)-labelling for planar graphs is NP-complete for k≥4

Eggemann, N. and Havet, F. and Noble, Steven (2010) k-L(2,1)-labelling for planar graphs is NP-complete for k≥4. Discrete Applied Mathematics 158 (16), pp. 1777-1788. ISSN 0166-218X.

Full text not available from this repository.

Official URL: https://doi.org/10.1016/j.dam.2010.06.016

Metadata

Item Type:	Article
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Administrator
Date Deposited:	06 Jan 2023 14:39
Last Modified:	09 Aug 2023 12:54
URI:	https://eprints.bbk.ac.uk/id/eprint/50379

Statistics

Archive Staff Only (login required)