Sciweavers

DAM
2011
13 years 6 months ago
Weak sense of direction labelings and graph embeddings
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...
Christine T. Cheng, Ichiro Suzuki
SIROCCO
2000
14 years 24 days ago
Lower bounds for (weak) sense of direction
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...
Paolo Boldi, Sebastiano Vigna