We introduce the concept of a free -valuation of a graph, and prove that the vertex-disjoint union of any collection of graphs with free -valuations has an -valuation. Many bipartite graphs have free -valuations, including the complete bipartite graph when and , and the -cube for .