MASCOTTE no longer exists => visit the new project-team
Publications of N. Eggemann
BACK TO MASCOTTE PUBLICATION INDEX
Publications of N. Eggemann
-
N. Eggemann,
F. Havet,
and S. Noble.
k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$.
Discrete Applied Mathematics,
158(16):1777--1788,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Eggemann,
F. Havet,
and S. Noble.
$k$-$L(2,1)$-Labelling for Planar Graphs is NP-Complete for $k\geq 4$.
Research Report 6840,
INRIA,
February 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
BACK TO MASCOTTE PUBLICATION INDEX
Last modified: Thu Oct 10 14:10:01 2013
This document was translated from BibTEX by
bibtex2html
| 
