Links in edge-colored graphs

13 years 11 months ago

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

Conjectures | EJC 2007 | EJC 2010 | Pair Xi | Properly-edge-colored Version |

claim paper

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	EJC
Authors	J. M. Becu, M. Dah, Yannis Manoussakis, G. Mendy

Comments (0)