k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2010

k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$.


A mapping from the vertex set of a graph $G=(V,E)$ into an interval of integers $\{0, \dots ,k\}$ is an $L(2,1)$-labelling of $G$ of span $k$ if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a common neighbour are mapped onto distinct integers. It is known that for any fixed $k\ge 4$, deciding the existence of such a labelling is an NP-complete problem while it is polynomial for $k\leq 3$. For even $k\geq 8$, it remains NP-complete when restricted to planar graphs. In this paper, we show that it remains NP-complete for any $k \ge 4$ by reduction from Planar Cubic Two-Colourable Perfect Matching. Schaefer stated without proof that Planar Cubic Two-Colourable Perfect Matching is NP-complete. In this paper we give a proof of this.
Fichier principal
Vignette du fichier
L21NP.pdf (75.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00534520 , version 1 (23-10-2016)


  • HAL Id : inria-00534520 , version 1


Nicole Eggemann, Frédéric Havet, Steven Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$.. Discrete Applied Mathematics, 2010, 158 (16), pp.1777-1788. ⟨inria-00534520⟩
159 View
62 Download


Gmail Facebook Twitter LinkedIn More