Sciweavers

EJC
2010
13 years 4 months ago
Links in edge-colored graphs
A graph is k-linked (k-edge-linked), k 1, if for each k pairs of vertices x1, y1,
J. M. Becu, M. Dah, Yannis Manoussakis, G. Mendy