Publications of S. Noble

BACK TO COATI PUBLICATION INDEX

Publications of S. Noble

Articles in journal or book's chapters
  1. 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]
     
Internal reports
  1. 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 COATI PUBLICATION INDEX



Last modified: Tue Jul 25 17:12:07 2017