Sciweavers

Share
2 search results - page 1 / 1
» Note on edge-colored graphs and digraphs without properly co...
Sort
View
CORR
2007
Springer
113views Education» more  CORR 2007»
11 years 1 months ago
Note on edge-colored graphs and digraphs without properly colored cycles
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...
Gregory Gutin
COLOGNETWENTE
2009
11 years 2 months ago
Colored Trees in Edge-Colored Graphs
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...
A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
books