An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
A graph with n vertices and maximum degree cannot be given weak sense of direction using less than colours. It is known that n colours are always sufficient, but it has been conje...