570 search results - page 3 / 114 » Edge Coloring with Delays |
DAM
2002
13 years 5 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
COLOGNETWENTE
2009
13 years 7 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...
FSTTCS
2006
Springer
13 years 9 months ago
2006
Springer
COMBINATORICS
2007
13 years 5 months ago
2007
ALGORITHMICA
2002
13 years 5 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...