On the fractionalf-chromatic index of a graph
Xia Zhang, Jiguo Yu, Guizhen Liu · International Journal of Computer Mathematics · 2010
For a graph G, we assign a positive integer f(v) to each vertex v∈V(G). The f-chromatic index of G, denoted by , is the minimum number of f-matchings needed to partition E(G), where an f-matching of G is the edge set of a (0, f)-factor of G. In this paper, we give the exact value of the fractional f-chromatic index of a graph.