Brunel University Research Archive (BURA) >

Browsing by Author Eggemann, N

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 1 to 4 of 4
Issue DateTitleAuthor(s)
2009The clustering coefficient of a scale-free random graphEggemann, N; Noble, S D
2012The complexity of two graph orientation problemsEggemann, N; Noble, SD
2009k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4Eggemann, N; Havet, F; Noble, S D
2009Minimizing the oriented diameter of a planar graphEggemann, N; Noble, SD
Showing results 1 to 4 of 4