Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/3832
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEggemann, N-
dc.contributor.authorHavet, F-
dc.contributor.authorNoble, S D-
dc.coverage.spatial16-
dc.date.accessioned2009-11-11T16:35:34Z-
dc.date.available2009-11-11T16:35:34Z-
dc.date.issued2009-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/3832-
dc.description.abstractA mapping from the vertex set of a graph G=(V,E) into an interval of integers {0,...,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>=4, deciding the existence of such a labelling is an NP-complete problem while it is polynomial for k<=3. For even k>=8, it remains NP-complete when restricted to planar graphs. In this paper, we show that it remains NP-complete for any k>=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.en
dc.language.isoenen
dc.subjectfrequency assignment problemen
dc.subjectgraph labellingen
dc.subjectplanar graphen
dc.subjectcomplexityen
dc.titlek-L(2, 1)-labelling for planar graphs is NP-complete for k>=4en
dc.typePreprinten
Appears in Collections:Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
Fulltext.pdf208.79 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.