Browsing by Author Eggemann, N
Showing results 3 to 4 of 4
< previous
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 |