Authors: Xia Zhang Gui Zhen Liu
Publish Date: 2008/05/18
Volume: 24, Issue: 5, Pages: 743-
Abstract
An fcoloring of a graph G is an edgecoloring of G such that each color appears at each vertex v ∈ VG at most fv times The minimum number of colors needed to fcolor G is called the fchromatic index of G and is denoted by x′ f G Any simple graph G has the fchromatic index equal to Δ f G or Δ f G + 1 where Δ f G = max v∈VG⌈dv/fv⌊ If x′ f G = Δ f G then G is of fclass 1 otherwise G is of fclass 2 In this paper a class of graphs of fclass 1 are obtained by a constructive proof As a result fcolorings of these graphs with Δ f G colors are given
Keywords: