DAM
2002
13 years 11 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 ...
DAM
2002
13 years 11 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
DAM
2002
13 years 11 months ago
2002
DAM
2002
13 years 11 months ago
2002
DAM
2002
13 years 11 months ago
2002
DAM
2002
13 years 11 months ago
2002
DAM
2002
13 years 11 months ago
2002
We investigate the e ect on primitive words of point mutations (inserting or deleting symbols, substituting a symbol for another one), of morphisms, and of the operation of taking...
DAM
2002
13 years 11 months ago
2002
DAM
2002
13 years 11 months ago
2002
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
DAM
2002
13 years 11 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...