T-Colorings of Multigraphs
Juan Du · 2010
T-colorings of multigraphs are a more practical case of T-colorings of graphs where interference may occur on different level. A multigraph G can be partitioned into K distinct sets, so we represent G as G(V,G0,G1,G2,...,GK-1). The span of a T-coloring of G equals max |f(x)-f(y)|, where the maximum is taken over all edges {x, y} ϵ E(G). The minimum order, and minimum span, where the minimum is taken over all T-colorings of G, are denoted by XT(G), and spT(G), respectively. We will show several previous results of multigraphs, and we also will present a new algorithm to compute spT(G) of multigraphs.