Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874204 | Information Processing Letters | 2018 | 5 Pages |
Abstract
An f-coloring of a graph G is an edge coloring of G such that each color appears at each vertex vâV(G) at most f(v) times. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by Ïfâ²(G). Any simple graph G has the f-chromatic index equal to Îf(G) or Îf(G)+1, where Îf(G)=maxvâV(G)â¡{âd(v)f(v)â}. If Ïfâ²(G)=Îf(G), then G is of f-class 1, otherwise G is of f-class 2. In this paper, we give some sufficient conditions for a nearly bipartite graph to be of f-class 1.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Yuzhuo Zhang, Xia Zhang,