2 search results - page 1 / 1 » Note on edge-colored graphs and digraphs without properly co... |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
COLOGNETWENTE
2009
13 years 5 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...