Edge colorings in bipartite graphs

Edge colorings in bipartite graphs

Regular price $20.00 $16.00 Sale

The determination of conditions for color-feasibility of a list of nonnegative integers, P, in a bipartite graph, G. Necesssary and sufficient conditions are obtained in case the n-list P contains at most two distinct positive integers. It is shown t...