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.
Search
Add filters:
Use filters to refine the search results.
Results 1-3 of 3 (Search time: 0.002 seconds).
- previous
- 1
- next
Item hits:
| 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 |
| 2009 | Minimizing the oriented diameter of a planar graph | Eggemann, N; Noble, SD |
| 2009 | The clustering coefficient of a scale-free random graph | Eggemann, N; Noble, S D |