Browse by Journal and Volume
 | Up a level |
Jump to: 28 August 2010
Number of items: 1.
28 August 2010
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.