Sciweavers

WDAG
2000
Springer
112views Algorithms» more  WDAG 2000»
13 years 8 months ago
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
Paolo Boldi, Sebastiano Vigna