Brunel University Research Archive(BURA) preserves and enables easy and open access to all
types of digital content. It showcases Brunel's research outputs.
Research contained within BURA is open access, although some publications may be subject
to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.
Browsing by Subject frequency assignment problem
Showing results 1 to 1 of 1
| Issue Date | Title | Author(s) |
|---|---|---|
| 2009 | k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4 | Eggemann, N; Havet, F; Noble, S D |