On the fractional f-chromatic index of a graph

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.

[1]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[2]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[3]  Xia Zhang,et al.  Some sufficient conditions for a graph to be of Cf 1 , 2006, Appl. Math. Lett..

[4]  Mark K. Goldberg.  Clusters in a Multigraph with Elevated Density , 2007, Electron. J. Comb..

[5]  Edward G. Coffman,et al.  Scheduling File Transfers , 1985, SIAM J. Comput..

[6]  Hyeong-Ah Choi,et al.  Scheduling File Transfers for Trees and Odd Cycles , 1987, SIAM J. Comput..

[7]  Gui Zhen Liu,et al.  f-Colorings of some graphs of f-class 1 , 2008 .

[8]  E. Scheinerman,et al.  Fractional Graph Theory: A Rational Approach to the Theory of Graphs , 1997 .

[9]  Xia Zhang,et al.  A Class of Graphs of f -Class 1 , 2007, International Conference on Computational Science.

[10]  Xia Zhang,et al.  The Classification of Regular Graphs on f-colorings , 2008, Ars Comb..

[11]  Henryk Krawczyk,et al.  An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems , 1985, IEEE Transactions on Computers.

[12]  S. Louis Hakimi,et al.  A generalization of edge-coloring in graphs , 1986, J. Graph Theory.

[13]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[14]  Takao Nishizeki,et al.  On the f-coloring of multigraphs , 1988 .

[15]  Xia Zhang,et al.  The classification of complete graphsKn onf-coloring , 2005 .

[16]  Xia Zhang,et al.  Some graphs of class 1 for f-colorings , 2008, Appl. Math. Lett..

[17]  Jianfeng Hou,et al.  Some results about f‐critical graphs , 2007, Networks.