Browsing by Author Eggemann, N
Showing results 1 to 4 of 4
Issue Date | Title | Author(s) |
---|---|---|
2009 | The clustering coefficient of a scale-free random graph | Eggemann, N; Noble, S D |
2012 | The complexity of two graph orientation problems | Eggemann, N; Noble, SD |
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 |